276.82/204.54 YES 276.82/204.54 276.82/204.54 Ultimate: Cannot open display: 276.82/204.54 This is Ultimate 0.1.24-8dc7c08-m 276.82/204.54 [2019-03-28 12:37:30,643 INFO L170 SettingsManager]: Resetting all preferences to default values... 276.82/204.54 [2019-03-28 12:37:30,646 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 276.82/204.54 [2019-03-28 12:37:30,657 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 276.82/204.54 [2019-03-28 12:37:30,657 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 276.82/204.54 [2019-03-28 12:37:30,658 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 276.82/204.54 [2019-03-28 12:37:30,659 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 276.82/204.54 [2019-03-28 12:37:30,661 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 276.82/204.54 [2019-03-28 12:37:30,663 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 276.82/204.54 [2019-03-28 12:37:30,663 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 276.82/204.54 [2019-03-28 12:37:30,664 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 276.82/204.54 [2019-03-28 12:37:30,664 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 276.82/204.54 [2019-03-28 12:37:30,665 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 276.82/204.54 [2019-03-28 12:37:30,666 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 276.82/204.54 [2019-03-28 12:37:30,667 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 276.82/204.54 [2019-03-28 12:37:30,668 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 276.82/204.54 [2019-03-28 12:37:30,669 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 276.82/204.54 [2019-03-28 12:37:30,671 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 276.82/204.54 [2019-03-28 12:37:30,673 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 276.82/204.54 [2019-03-28 12:37:30,674 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 276.82/204.54 [2019-03-28 12:37:30,675 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 276.82/204.54 [2019-03-28 12:37:30,676 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 276.82/204.54 [2019-03-28 12:37:30,679 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 276.82/204.54 [2019-03-28 12:37:30,679 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 276.82/204.54 [2019-03-28 12:37:30,679 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 276.82/204.54 [2019-03-28 12:37:30,680 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 276.82/204.54 [2019-03-28 12:37:30,680 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 276.82/204.54 [2019-03-28 12:37:30,681 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 276.82/204.54 [2019-03-28 12:37:30,681 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 276.82/204.54 [2019-03-28 12:37:30,682 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 276.82/204.54 [2019-03-28 12:37:30,683 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 276.82/204.54 [2019-03-28 12:37:30,684 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 276.82/204.54 [2019-03-28 12:37:30,685 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 276.82/204.54 [2019-03-28 12:37:30,685 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 276.82/204.54 [2019-03-28 12:37:30,685 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 276.82/204.54 [2019-03-28 12:37:30,686 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 276.82/204.54 [2019-03-28 12:37:30,686 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 276.82/204.54 [2019-03-28 12:37:30,687 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 276.82/204.54 [2019-03-28 12:37:30,687 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 276.82/204.54 [2019-03-28 12:37:30,688 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 276.82/204.54 [2019-03-28 12:37:30,703 INFO L110 SettingsManager]: Loading preferences was successful 276.82/204.54 [2019-03-28 12:37:30,703 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 276.82/204.54 [2019-03-28 12:37:30,704 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 276.82/204.54 [2019-03-28 12:37:30,704 INFO L133 SettingsManager]: * Rewrite not-equals=true 276.82/204.54 [2019-03-28 12:37:30,705 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 276.82/204.54 [2019-03-28 12:37:30,705 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 276.82/204.54 [2019-03-28 12:37:30,705 INFO L133 SettingsManager]: * Use SBE=true 276.82/204.54 [2019-03-28 12:37:30,705 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 276.82/204.54 [2019-03-28 12:37:30,705 INFO L133 SettingsManager]: * Use old map elimination=false 276.82/204.54 [2019-03-28 12:37:30,706 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 276.82/204.54 [2019-03-28 12:37:30,706 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 276.82/204.54 [2019-03-28 12:37:30,706 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 276.82/204.54 [2019-03-28 12:37:30,706 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 276.82/204.54 [2019-03-28 12:37:30,706 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 276.82/204.54 [2019-03-28 12:37:30,706 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 276.82/204.54 [2019-03-28 12:37:30,707 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 276.82/204.54 [2019-03-28 12:37:30,707 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 276.82/204.54 [2019-03-28 12:37:30,707 INFO L133 SettingsManager]: * Check division by zero=IGNORE 276.82/204.54 [2019-03-28 12:37:30,707 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 276.82/204.54 [2019-03-28 12:37:30,707 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 276.82/204.54 [2019-03-28 12:37:30,708 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 276.82/204.54 [2019-03-28 12:37:30,708 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 276.82/204.54 [2019-03-28 12:37:30,708 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 276.82/204.54 [2019-03-28 12:37:30,708 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 276.82/204.54 [2019-03-28 12:37:30,708 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 276.82/204.54 [2019-03-28 12:37:30,709 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 276.82/204.54 [2019-03-28 12:37:30,709 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 276.82/204.54 [2019-03-28 12:37:30,709 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 276.82/204.54 [2019-03-28 12:37:30,709 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 276.82/204.54 [2019-03-28 12:37:30,735 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 276.82/204.54 [2019-03-28 12:37:30,748 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 276.82/204.54 [2019-03-28 12:37:30,752 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 276.82/204.54 [2019-03-28 12:37:30,753 INFO L271 PluginConnector]: Initializing CDTParser... 276.82/204.54 [2019-03-28 12:37:30,754 INFO L276 PluginConnector]: CDTParser initialized 276.82/204.54 [2019-03-28 12:37:30,754 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 276.82/204.54 [2019-03-28 12:37:30,814 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/6b1039bd04e34d02a17c3eac9e8552ea/FLAG74b5a6e32 276.82/204.54 [2019-03-28 12:37:31,195 INFO L307 CDTParser]: Found 1 translation units. 276.82/204.54 [2019-03-28 12:37:31,196 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 276.82/204.54 [2019-03-28 12:37:31,196 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 276.82/204.54 [2019-03-28 12:37:31,203 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/6b1039bd04e34d02a17c3eac9e8552ea/FLAG74b5a6e32 276.82/204.54 [2019-03-28 12:37:31,588 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/6b1039bd04e34d02a17c3eac9e8552ea 276.82/204.54 [2019-03-28 12:37:31,599 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 276.82/204.54 [2019-03-28 12:37:31,600 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 276.82/204.54 [2019-03-28 12:37:31,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 276.82/204.54 [2019-03-28 12:37:31,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 276.82/204.54 [2019-03-28 12:37:31,605 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 276.82/204.54 [2019-03-28 12:37:31,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:37:31" (1/1) ... 276.82/204.54 [2019-03-28 12:37:31,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61d40edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:31, skipping insertion in model container 276.82/204.54 [2019-03-28 12:37:31,609 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:37:31" (1/1) ... 276.82/204.54 [2019-03-28 12:37:31,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 276.82/204.54 [2019-03-28 12:37:31,634 INFO L176 MainTranslator]: Built tables and reachable declarations 276.82/204.54 [2019-03-28 12:37:31,800 INFO L206 PostProcessor]: Analyzing one entry point: main 276.82/204.54 [2019-03-28 12:37:31,812 INFO L191 MainTranslator]: Completed pre-run 276.82/204.54 [2019-03-28 12:37:31,892 INFO L206 PostProcessor]: Analyzing one entry point: main 276.82/204.54 [2019-03-28 12:37:31,909 INFO L195 MainTranslator]: Completed translation 276.82/204.54 [2019-03-28 12:37:31,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:31 WrapperNode 276.82/204.54 [2019-03-28 12:37:31,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 276.82/204.54 [2019-03-28 12:37:31,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 276.82/204.54 [2019-03-28 12:37:31,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 276.82/204.54 [2019-03-28 12:37:31,911 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 276.82/204.54 [2019-03-28 12:37:31,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:31" (1/1) ... 276.82/204.54 [2019-03-28 12:37:31,930 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:31" (1/1) ... 276.82/204.54 [2019-03-28 12:37:31,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 276.82/204.54 [2019-03-28 12:37:31,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 276.82/204.54 [2019-03-28 12:37:31,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 276.82/204.54 [2019-03-28 12:37:31,954 INFO L276 PluginConnector]: Boogie Preprocessor initialized 276.82/204.54 [2019-03-28 12:37:31,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:31" (1/1) ... 276.82/204.54 [2019-03-28 12:37:31,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:31" (1/1) ... 276.82/204.54 [2019-03-28 12:37:31,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:31" (1/1) ... 276.82/204.54 [2019-03-28 12:37:31,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:31" (1/1) ... 276.82/204.54 [2019-03-28 12:37:31,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:31" (1/1) ... 276.82/204.54 [2019-03-28 12:37:31,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:31" (1/1) ... 276.82/204.54 [2019-03-28 12:37:31,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:31" (1/1) ... 276.82/204.54 [2019-03-28 12:37:31,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 276.82/204.54 [2019-03-28 12:37:31,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 276.82/204.54 [2019-03-28 12:37:31,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... 276.82/204.54 [2019-03-28 12:37:31,980 INFO L276 PluginConnector]: RCFGBuilder initialized 276.82/204.54 [2019-03-28 12:37:31,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:31" (1/1) ... 276.82/204.54 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 276.82/204.54 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 276.82/204.54 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 276.82/204.54 [2019-03-28 12:37:32,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 276.82/204.54 [2019-03-28 12:37:32,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 276.82/204.54 [2019-03-28 12:37:32,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 276.82/204.54 [2019-03-28 12:37:32,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 276.82/204.54 [2019-03-28 12:37:32,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 276.82/204.54 [2019-03-28 12:37:32,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 276.82/204.54 [2019-03-28 12:37:32,352 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 276.82/204.54 [2019-03-28 12:37:32,353 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 276.82/204.54 [2019-03-28 12:37:32,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:37:32 BoogieIcfgContainer 276.82/204.54 [2019-03-28 12:37:32,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 276.82/204.54 [2019-03-28 12:37:32,355 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 276.82/204.54 [2019-03-28 12:37:32,355 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 276.82/204.54 [2019-03-28 12:37:32,357 INFO L276 PluginConnector]: BlockEncodingV2 initialized 276.82/204.54 [2019-03-28 12:37:32,358 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:37:32" (1/1) ... 276.82/204.54 [2019-03-28 12:37:32,379 INFO L313 BlockEncoder]: Initial Icfg 59 locations, 63 edges 276.82/204.54 [2019-03-28 12:37:32,381 INFO L258 BlockEncoder]: Using Remove infeasible edges 276.82/204.54 [2019-03-28 12:37:32,381 INFO L263 BlockEncoder]: Using Maximize final states 276.82/204.54 [2019-03-28 12:37:32,382 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 276.82/204.54 [2019-03-28 12:37:32,382 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 276.82/204.54 [2019-03-28 12:37:32,384 INFO L296 BlockEncoder]: Using Remove sink states 276.82/204.54 [2019-03-28 12:37:32,385 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 276.82/204.54 [2019-03-28 12:37:32,385 INFO L179 BlockEncoder]: Using Rewrite not-equals 276.82/204.54 [2019-03-28 12:37:32,415 INFO L185 BlockEncoder]: Using Use SBE 276.82/204.54 [2019-03-28 12:37:32,451 INFO L200 BlockEncoder]: SBE split 34 edges 276.82/204.54 [2019-03-28 12:37:32,457 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 276.82/204.54 [2019-03-28 12:37:32,459 INFO L71 MaximizeFinalStates]: 0 new accepting states 276.82/204.54 [2019-03-28 12:37:32,482 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding 276.82/204.54 [2019-03-28 12:37:32,485 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states 276.82/204.54 [2019-03-28 12:37:32,487 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 276.82/204.54 [2019-03-28 12:37:32,487 INFO L71 MaximizeFinalStates]: 0 new accepting states 276.82/204.54 [2019-03-28 12:37:32,488 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 276.82/204.54 [2019-03-28 12:37:32,488 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 276.82/204.54 [2019-03-28 12:37:32,489 INFO L313 BlockEncoder]: Encoded RCFG 50 locations, 89 edges 276.82/204.54 [2019-03-28 12:37:32,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:37:32 BasicIcfg 276.82/204.54 [2019-03-28 12:37:32,489 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 276.82/204.54 [2019-03-28 12:37:32,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 276.82/204.54 [2019-03-28 12:37:32,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... 276.82/204.54 [2019-03-28 12:37:32,494 INFO L276 PluginConnector]: TraceAbstraction initialized 276.82/204.54 [2019-03-28 12:37:32,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:37:31" (1/4) ... 276.82/204.54 [2019-03-28 12:37:32,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de288dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:37:32, skipping insertion in model container 276.82/204.54 [2019-03-28 12:37:32,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:31" (2/4) ... 276.82/204.54 [2019-03-28 12:37:32,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de288dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:37:32, skipping insertion in model container 276.82/204.54 [2019-03-28 12:37:32,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:37:32" (3/4) ... 276.82/204.54 [2019-03-28 12:37:32,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de288dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:37:32, skipping insertion in model container 276.82/204.54 [2019-03-28 12:37:32,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:37:32" (4/4) ... 276.82/204.54 [2019-03-28 12:37:32,499 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 276.82/204.54 [2019-03-28 12:37:32,510 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 276.82/204.54 [2019-03-28 12:37:32,518 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. 276.82/204.54 [2019-03-28 12:37:32,535 INFO L257 AbstractCegarLoop]: Starting to check reachability of 28 error locations. 276.82/204.54 [2019-03-28 12:37:32,564 INFO L133 ementStrategyFactory]: Using default assertion order modulation 276.82/204.54 [2019-03-28 12:37:32,565 INFO L382 AbstractCegarLoop]: Interprodecural is true 276.82/204.54 [2019-03-28 12:37:32,565 INFO L383 AbstractCegarLoop]: Hoare is true 276.82/204.54 [2019-03-28 12:37:32,566 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 276.82/204.54 [2019-03-28 12:37:32,566 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 276.82/204.54 [2019-03-28 12:37:32,566 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 276.82/204.54 [2019-03-28 12:37:32,566 INFO L387 AbstractCegarLoop]: Difference is false 276.82/204.54 [2019-03-28 12:37:32,566 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 276.82/204.54 [2019-03-28 12:37:32,566 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 276.82/204.54 [2019-03-28 12:37:32,582 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. 276.82/204.54 [2019-03-28 12:37:32,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 276.82/204.54 [2019-03-28 12:37:32,588 INFO L394 BasicCegarLoop]: Found error trace 276.82/204.54 [2019-03-28 12:37:32,589 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 276.82/204.54 [2019-03-28 12:37:32,590 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION]=== 276.82/204.54 [2019-03-28 12:37:32,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.54 [2019-03-28 12:37:32,595 INFO L82 PathProgramCache]: Analyzing trace with hash 151932, now seen corresponding path program 1 times 276.82/204.54 [2019-03-28 12:37:32,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.54 [2019-03-28 12:37:32,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.54 [2019-03-28 12:37:32,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.54 [2019-03-28 12:37:32,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.54 [2019-03-28 12:37:32,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.54 [2019-03-28 12:37:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.54 [2019-03-28 12:37:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 276.82/204.54 [2019-03-28 12:37:32,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 276.82/204.54 [2019-03-28 12:37:32,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 276.82/204.54 [2019-03-28 12:37:32,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 276.82/204.54 [2019-03-28 12:37:32,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 276.82/204.54 [2019-03-28 12:37:32,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 276.82/204.54 [2019-03-28 12:37:32,794 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. 276.82/204.54 [2019-03-28 12:37:33,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 276.82/204.54 [2019-03-28 12:37:33,001 INFO L93 Difference]: Finished difference Result 50 states and 89 transitions. 276.82/204.54 [2019-03-28 12:37:33,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 276.82/204.54 [2019-03-28 12:37:33,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 276.82/204.54 [2019-03-28 12:37:33,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 276.82/204.54 [2019-03-28 12:37:33,017 INFO L225 Difference]: With dead ends: 50 276.82/204.54 [2019-03-28 12:37:33,017 INFO L226 Difference]: Without dead ends: 45 276.82/204.54 [2019-03-28 12:37:33,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 276.82/204.54 [2019-03-28 12:37:33,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. 276.82/204.54 [2019-03-28 12:37:33,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. 276.82/204.54 [2019-03-28 12:37:33,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. 276.82/204.54 [2019-03-28 12:37:33,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 79 transitions. 276.82/204.54 [2019-03-28 12:37:33,062 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 79 transitions. Word has length 3 276.82/204.54 [2019-03-28 12:37:33,063 INFO L84 Accepts]: Finished accepts. word is rejected. 276.82/204.54 [2019-03-28 12:37:33,063 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 79 transitions. 276.82/204.54 [2019-03-28 12:37:33,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 276.82/204.54 [2019-03-28 12:37:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. 276.82/204.54 [2019-03-28 12:37:33,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 276.82/204.54 [2019-03-28 12:37:33,064 INFO L394 BasicCegarLoop]: Found error trace 276.82/204.54 [2019-03-28 12:37:33,064 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 276.82/204.54 [2019-03-28 12:37:33,065 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION]=== 276.82/204.54 [2019-03-28 12:37:33,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.54 [2019-03-28 12:37:33,065 INFO L82 PathProgramCache]: Analyzing trace with hash 151934, now seen corresponding path program 1 times 276.82/204.54 [2019-03-28 12:37:33,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.54 [2019-03-28 12:37:33,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.54 [2019-03-28 12:37:33,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.54 [2019-03-28 12:37:33,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.54 [2019-03-28 12:37:33,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.54 [2019-03-28 12:37:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.54 [2019-03-28 12:37:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 276.82/204.54 [2019-03-28 12:37:33,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 276.82/204.54 [2019-03-28 12:37:33,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 276.82/204.54 [2019-03-28 12:37:33,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 276.82/204.54 [2019-03-28 12:37:33,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 276.82/204.55 [2019-03-28 12:37:33,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 276.82/204.55 [2019-03-28 12:37:33,098 INFO L87 Difference]: Start difference. First operand 45 states and 79 transitions. Second operand 3 states. 276.82/204.55 [2019-03-28 12:37:33,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 276.82/204.55 [2019-03-28 12:37:33,201 INFO L93 Difference]: Finished difference Result 50 states and 79 transitions. 276.82/204.55 [2019-03-28 12:37:33,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 276.82/204.55 [2019-03-28 12:37:33,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 276.82/204.55 [2019-03-28 12:37:33,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 276.82/204.55 [2019-03-28 12:37:33,203 INFO L225 Difference]: With dead ends: 50 276.82/204.55 [2019-03-28 12:37:33,203 INFO L226 Difference]: Without dead ends: 45 276.82/204.55 [2019-03-28 12:37:33,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 276.82/204.55 [2019-03-28 12:37:33,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. 276.82/204.55 [2019-03-28 12:37:33,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. 276.82/204.55 [2019-03-28 12:37:33,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. 276.82/204.55 [2019-03-28 12:37:33,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 74 transitions. 276.82/204.55 [2019-03-28 12:37:33,210 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 74 transitions. Word has length 3 276.82/204.55 [2019-03-28 12:37:33,211 INFO L84 Accepts]: Finished accepts. word is rejected. 276.82/204.55 [2019-03-28 12:37:33,211 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 74 transitions. 276.82/204.55 [2019-03-28 12:37:33,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 276.82/204.55 [2019-03-28 12:37:33,211 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 74 transitions. 276.82/204.55 [2019-03-28 12:37:33,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 276.82/204.55 [2019-03-28 12:37:33,211 INFO L394 BasicCegarLoop]: Found error trace 276.82/204.55 [2019-03-28 12:37:33,212 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 276.82/204.55 [2019-03-28 12:37:33,212 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION]=== 276.82/204.55 [2019-03-28 12:37:33,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:33,212 INFO L82 PathProgramCache]: Analyzing trace with hash 151935, now seen corresponding path program 1 times 276.82/204.55 [2019-03-28 12:37:33,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:33,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:33,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:33,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:33,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:33,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 276.82/204.55 [2019-03-28 12:37:33,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 276.82/204.55 [2019-03-28 12:37:33,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 276.82/204.55 [2019-03-28 12:37:33,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 276.82/204.55 [2019-03-28 12:37:33,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 276.82/204.55 [2019-03-28 12:37:33,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 276.82/204.55 [2019-03-28 12:37:33,248 INFO L87 Difference]: Start difference. First operand 45 states and 74 transitions. Second operand 3 states. 276.82/204.55 [2019-03-28 12:37:33,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 276.82/204.55 [2019-03-28 12:37:33,357 INFO L93 Difference]: Finished difference Result 45 states and 74 transitions. 276.82/204.55 [2019-03-28 12:37:33,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 276.82/204.55 [2019-03-28 12:37:33,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 276.82/204.55 [2019-03-28 12:37:33,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 276.82/204.55 [2019-03-28 12:37:33,359 INFO L225 Difference]: With dead ends: 45 276.82/204.55 [2019-03-28 12:37:33,359 INFO L226 Difference]: Without dead ends: 40 276.82/204.55 [2019-03-28 12:37:33,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 276.82/204.55 [2019-03-28 12:37:33,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. 276.82/204.55 [2019-03-28 12:37:33,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. 276.82/204.55 [2019-03-28 12:37:33,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. 276.82/204.55 [2019-03-28 12:37:33,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 69 transitions. 276.82/204.55 [2019-03-28 12:37:33,365 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 69 transitions. Word has length 3 276.82/204.55 [2019-03-28 12:37:33,365 INFO L84 Accepts]: Finished accepts. word is rejected. 276.82/204.55 [2019-03-28 12:37:33,365 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 69 transitions. 276.82/204.55 [2019-03-28 12:37:33,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 276.82/204.55 [2019-03-28 12:37:33,366 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 69 transitions. 276.82/204.55 [2019-03-28 12:37:33,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 276.82/204.55 [2019-03-28 12:37:33,366 INFO L394 BasicCegarLoop]: Found error trace 276.82/204.55 [2019-03-28 12:37:33,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 276.82/204.55 [2019-03-28 12:37:33,366 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION]=== 276.82/204.55 [2019-03-28 12:37:33,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:33,367 INFO L82 PathProgramCache]: Analyzing trace with hash 4712192, now seen corresponding path program 1 times 276.82/204.55 [2019-03-28 12:37:33,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:33,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:33,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:33,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:33,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:33,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 276.82/204.55 [2019-03-28 12:37:33,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 276.82/204.55 [2019-03-28 12:37:33,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 276.82/204.55 [2019-03-28 12:37:33,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 276.82/204.55 [2019-03-28 12:37:33,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 276.82/204.55 [2019-03-28 12:37:33,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 276.82/204.55 [2019-03-28 12:37:33,402 INFO L87 Difference]: Start difference. First operand 40 states and 69 transitions. Second operand 3 states. 276.82/204.55 [2019-03-28 12:37:33,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 276.82/204.55 [2019-03-28 12:37:33,513 INFO L93 Difference]: Finished difference Result 40 states and 69 transitions. 276.82/204.55 [2019-03-28 12:37:33,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 276.82/204.55 [2019-03-28 12:37:33,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 276.82/204.55 [2019-03-28 12:37:33,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 276.82/204.55 [2019-03-28 12:37:33,514 INFO L225 Difference]: With dead ends: 40 276.82/204.55 [2019-03-28 12:37:33,515 INFO L226 Difference]: Without dead ends: 37 276.82/204.55 [2019-03-28 12:37:33,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 276.82/204.55 [2019-03-28 12:37:33,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. 276.82/204.55 [2019-03-28 12:37:33,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. 276.82/204.55 [2019-03-28 12:37:33,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. 276.82/204.55 [2019-03-28 12:37:33,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 63 transitions. 276.82/204.55 [2019-03-28 12:37:33,520 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 63 transitions. Word has length 4 276.82/204.55 [2019-03-28 12:37:33,521 INFO L84 Accepts]: Finished accepts. word is rejected. 276.82/204.55 [2019-03-28 12:37:33,521 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 63 transitions. 276.82/204.55 [2019-03-28 12:37:33,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 276.82/204.55 [2019-03-28 12:37:33,521 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 63 transitions. 276.82/204.55 [2019-03-28 12:37:33,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 276.82/204.55 [2019-03-28 12:37:33,522 INFO L394 BasicCegarLoop]: Found error trace 276.82/204.55 [2019-03-28 12:37:33,522 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 276.82/204.55 [2019-03-28 12:37:33,522 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION]=== 276.82/204.55 [2019-03-28 12:37:33,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:33,522 INFO L82 PathProgramCache]: Analyzing trace with hash 4712193, now seen corresponding path program 1 times 276.82/204.55 [2019-03-28 12:37:33,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:33,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:33,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:33,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:33,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 276.82/204.55 [2019-03-28 12:37:33,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 276.82/204.55 [2019-03-28 12:37:33,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 276.82/204.55 [2019-03-28 12:37:33,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 276.82/204.55 [2019-03-28 12:37:33,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 276.82/204.55 [2019-03-28 12:37:33,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 276.82/204.55 [2019-03-28 12:37:33,557 INFO L87 Difference]: Start difference. First operand 37 states and 63 transitions. Second operand 3 states. 276.82/204.55 [2019-03-28 12:37:33,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 276.82/204.55 [2019-03-28 12:37:33,670 INFO L93 Difference]: Finished difference Result 37 states and 63 transitions. 276.82/204.55 [2019-03-28 12:37:33,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 276.82/204.55 [2019-03-28 12:37:33,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 276.82/204.55 [2019-03-28 12:37:33,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 276.82/204.55 [2019-03-28 12:37:33,672 INFO L225 Difference]: With dead ends: 37 276.82/204.55 [2019-03-28 12:37:33,672 INFO L226 Difference]: Without dead ends: 34 276.82/204.55 [2019-03-28 12:37:33,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 276.82/204.55 [2019-03-28 12:37:33,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. 276.82/204.55 [2019-03-28 12:37:33,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. 276.82/204.55 [2019-03-28 12:37:33,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 276.82/204.55 [2019-03-28 12:37:33,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. 276.82/204.55 [2019-03-28 12:37:33,677 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 4 276.82/204.55 [2019-03-28 12:37:33,677 INFO L84 Accepts]: Finished accepts. word is rejected. 276.82/204.55 [2019-03-28 12:37:33,677 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. 276.82/204.55 [2019-03-28 12:37:33,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 276.82/204.55 [2019-03-28 12:37:33,677 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. 276.82/204.55 [2019-03-28 12:37:33,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 276.82/204.55 [2019-03-28 12:37:33,678 INFO L394 BasicCegarLoop]: Found error trace 276.82/204.55 [2019-03-28 12:37:33,678 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 276.82/204.55 [2019-03-28 12:37:33,678 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION]=== 276.82/204.55 [2019-03-28 12:37:33,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:33,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1130493404, now seen corresponding path program 1 times 276.82/204.55 [2019-03-28 12:37:33,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:33,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:33,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:33,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:33,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:33,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 276.82/204.55 [2019-03-28 12:37:33,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 276.82/204.55 [2019-03-28 12:37:33,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 276.82/204.55 [2019-03-28 12:37:33,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 276.82/204.55 [2019-03-28 12:37:33,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 276.82/204.55 [2019-03-28 12:37:33,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 276.82/204.55 [2019-03-28 12:37:33,715 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. 276.82/204.55 [2019-03-28 12:37:33,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 276.82/204.55 [2019-03-28 12:37:33,793 INFO L93 Difference]: Finished difference Result 63 states and 106 transitions. 276.82/204.55 [2019-03-28 12:37:33,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 276.82/204.55 [2019-03-28 12:37:33,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 276.82/204.55 [2019-03-28 12:37:33,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 276.82/204.55 [2019-03-28 12:37:33,795 INFO L225 Difference]: With dead ends: 63 276.82/204.55 [2019-03-28 12:37:33,795 INFO L226 Difference]: Without dead ends: 34 276.82/204.55 [2019-03-28 12:37:33,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 276.82/204.55 [2019-03-28 12:37:33,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. 276.82/204.55 [2019-03-28 12:37:33,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. 276.82/204.55 [2019-03-28 12:37:33,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 276.82/204.55 [2019-03-28 12:37:33,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 54 transitions. 276.82/204.55 [2019-03-28 12:37:33,800 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 54 transitions. Word has length 10 276.82/204.55 [2019-03-28 12:37:33,800 INFO L84 Accepts]: Finished accepts. word is rejected. 276.82/204.55 [2019-03-28 12:37:33,801 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 54 transitions. 276.82/204.55 [2019-03-28 12:37:33,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 276.82/204.55 [2019-03-28 12:37:33,801 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 54 transitions. 276.82/204.55 [2019-03-28 12:37:33,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 276.82/204.55 [2019-03-28 12:37:33,801 INFO L394 BasicCegarLoop]: Found error trace 276.82/204.55 [2019-03-28 12:37:33,802 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 276.82/204.55 [2019-03-28 12:37:33,802 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION]=== 276.82/204.55 [2019-03-28 12:37:33,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:33,802 INFO L82 PathProgramCache]: Analyzing trace with hash -596832724, now seen corresponding path program 1 times 276.82/204.55 [2019-03-28 12:37:33,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:33,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:33,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:33,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:33,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:33,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 276.82/204.55 [2019-03-28 12:37:33,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 276.82/204.55 [2019-03-28 12:37:33,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 276.82/204.55 [2019-03-28 12:37:33,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 276.82/204.55 [2019-03-28 12:37:33,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 276.82/204.55 [2019-03-28 12:37:33,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 276.82/204.55 [2019-03-28 12:37:33,848 INFO L87 Difference]: Start difference. First operand 34 states and 54 transitions. Second operand 3 states. 276.82/204.55 [2019-03-28 12:37:33,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 276.82/204.55 [2019-03-28 12:37:33,922 INFO L93 Difference]: Finished difference Result 34 states and 54 transitions. 276.82/204.55 [2019-03-28 12:37:33,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 276.82/204.55 [2019-03-28 12:37:33,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 276.82/204.55 [2019-03-28 12:37:33,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 276.82/204.55 [2019-03-28 12:37:33,923 INFO L225 Difference]: With dead ends: 34 276.82/204.55 [2019-03-28 12:37:33,923 INFO L226 Difference]: Without dead ends: 28 276.82/204.55 [2019-03-28 12:37:33,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 276.82/204.55 [2019-03-28 12:37:33,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 276.82/204.55 [2019-03-28 12:37:33,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 276.82/204.55 [2019-03-28 12:37:33,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 276.82/204.55 [2019-03-28 12:37:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. 276.82/204.55 [2019-03-28 12:37:33,927 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 42 transitions. Word has length 13 276.82/204.55 [2019-03-28 12:37:33,927 INFO L84 Accepts]: Finished accepts. word is rejected. 276.82/204.55 [2019-03-28 12:37:33,928 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 42 transitions. 276.82/204.55 [2019-03-28 12:37:33,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 276.82/204.55 [2019-03-28 12:37:33,928 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 42 transitions. 276.82/204.55 [2019-03-28 12:37:33,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 276.82/204.55 [2019-03-28 12:37:33,929 INFO L394 BasicCegarLoop]: Found error trace 276.82/204.55 [2019-03-28 12:37:33,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 276.82/204.55 [2019-03-28 12:37:33,929 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION]=== 276.82/204.55 [2019-03-28 12:37:33,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:33,930 INFO L82 PathProgramCache]: Analyzing trace with hash -596832722, now seen corresponding path program 1 times 276.82/204.55 [2019-03-28 12:37:33,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:33,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:33,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:33,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:33,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:33,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 276.82/204.55 [2019-03-28 12:37:33,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 276.82/204.55 [2019-03-28 12:37:33,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 276.82/204.55 [2019-03-28 12:37:33,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 276.82/204.55 [2019-03-28 12:37:33,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 276.82/204.55 [2019-03-28 12:37:33,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 276.82/204.55 [2019-03-28 12:37:33,962 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. Second operand 3 states. 276.82/204.55 [2019-03-28 12:37:34,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 276.82/204.55 [2019-03-28 12:37:34,008 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. 276.82/204.55 [2019-03-28 12:37:34,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 276.82/204.55 [2019-03-28 12:37:34,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 276.82/204.55 [2019-03-28 12:37:34,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 276.82/204.55 [2019-03-28 12:37:34,009 INFO L225 Difference]: With dead ends: 34 276.82/204.55 [2019-03-28 12:37:34,009 INFO L226 Difference]: Without dead ends: 28 276.82/204.55 [2019-03-28 12:37:34,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 276.82/204.55 [2019-03-28 12:37:34,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 276.82/204.55 [2019-03-28 12:37:34,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 276.82/204.55 [2019-03-28 12:37:34,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 276.82/204.55 [2019-03-28 12:37:34,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. 276.82/204.55 [2019-03-28 12:37:34,013 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 13 276.82/204.55 [2019-03-28 12:37:34,014 INFO L84 Accepts]: Finished accepts. word is rejected. 276.82/204.55 [2019-03-28 12:37:34,014 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. 276.82/204.55 [2019-03-28 12:37:34,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 276.82/204.55 [2019-03-28 12:37:34,014 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. 276.82/204.55 [2019-03-28 12:37:34,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 276.82/204.55 [2019-03-28 12:37:34,015 INFO L394 BasicCegarLoop]: Found error trace 276.82/204.55 [2019-03-28 12:37:34,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 276.82/204.55 [2019-03-28 12:37:34,015 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION]=== 276.82/204.55 [2019-03-28 12:37:34,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:34,015 INFO L82 PathProgramCache]: Analyzing trace with hash -596832721, now seen corresponding path program 1 times 276.82/204.55 [2019-03-28 12:37:34,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:34,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:34,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:34,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:34,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:34,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 276.82/204.55 [2019-03-28 12:37:34,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 276.82/204.55 [2019-03-28 12:37:34,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 276.82/204.55 [2019-03-28 12:37:34,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 276.82/204.55 [2019-03-28 12:37:34,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 276.82/204.55 [2019-03-28 12:37:34,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 276.82/204.55 [2019-03-28 12:37:34,052 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 3 states. 276.82/204.55 [2019-03-28 12:37:34,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 276.82/204.55 [2019-03-28 12:37:34,095 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. 276.82/204.55 [2019-03-28 12:37:34,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 276.82/204.55 [2019-03-28 12:37:34,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 276.82/204.55 [2019-03-28 12:37:34,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 276.82/204.55 [2019-03-28 12:37:34,096 INFO L225 Difference]: With dead ends: 28 276.82/204.55 [2019-03-28 12:37:34,097 INFO L226 Difference]: Without dead ends: 0 276.82/204.55 [2019-03-28 12:37:34,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 276.82/204.55 [2019-03-28 12:37:34,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 276.82/204.55 [2019-03-28 12:37:34,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 276.82/204.55 [2019-03-28 12:37:34,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 276.82/204.55 [2019-03-28 12:37:34,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 276.82/204.55 [2019-03-28 12:37:34,098 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 276.82/204.55 [2019-03-28 12:37:34,098 INFO L84 Accepts]: Finished accepts. word is rejected. 276.82/204.55 [2019-03-28 12:37:34,098 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 276.82/204.55 [2019-03-28 12:37:34,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 276.82/204.55 [2019-03-28 12:37:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 276.82/204.55 [2019-03-28 12:37:34,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 276.82/204.55 [2019-03-28 12:37:34,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 276.82/204.55 [2019-03-28 12:37:34,131 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,131 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,132 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,132 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,132 INFO L448 ceAbstractionStarter]: For program point L15-2(lines 15 19) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,132 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,132 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,132 INFO L448 ceAbstractionStarter]: For program point L11-2(line 11) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,132 INFO L448 ceAbstractionStarter]: For program point L11-3(line 11) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,132 INFO L448 ceAbstractionStarter]: For program point L11-4(line 11) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,133 INFO L448 ceAbstractionStarter]: For program point L11-5(line 11) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,133 INFO L448 ceAbstractionStarter]: For program point L11-7(lines 11 21) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,133 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,133 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,133 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,133 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,133 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,133 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,134 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,134 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,134 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,134 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,134 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,134 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,134 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,134 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,135 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,135 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,135 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,135 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,135 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,136 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,136 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,136 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,136 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,136 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,136 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,136 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,136 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,137 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,137 INFO L444 ceAbstractionStarter]: At program point L18-1(lines 14 20) the Hoare annotation is: (and (= 0 ULTIMATE.start_main_~maxId~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~maxId~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~maxId~0.base)) (= ULTIMATE.start_main_~id~0.offset 0) (= (select |#valid| ULTIMATE.start_main_~tmp~0.base) 1) (= (select |#length| ULTIMATE.start_main_~id~0.base) 4) (= 1 (select |#valid| ULTIMATE.start_main_~id~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~tmp~0.base)) (= ULTIMATE.start_main_~tmp~0.offset 0)) 276.82/204.55 [2019-03-28 12:37:34,137 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,137 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,137 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,138 INFO L448 ceAbstractionStarter]: For program point L14-2(lines 14 20) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,138 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,138 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,138 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,138 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,138 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 276.82/204.55 [2019-03-28 12:37:34,138 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 276.82/204.55 [2019-03-28 12:37:34,147 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 276.82/204.55 [2019-03-28 12:37:34,148 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 276.82/204.55 [2019-03-28 12:37:34,149 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 276.82/204.55 [2019-03-28 12:37:34,155 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 276.82/204.55 [2019-03-28 12:37:34,156 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 276.82/204.55 [2019-03-28 12:37:34,156 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 276.82/204.55 [2019-03-28 12:37:34,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:37:34 BasicIcfg 276.82/204.55 [2019-03-28 12:37:34,158 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 276.82/204.55 [2019-03-28 12:37:34,159 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 276.82/204.55 [2019-03-28 12:37:34,159 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 276.82/204.55 [2019-03-28 12:37:34,162 INFO L276 PluginConnector]: BuchiAutomizer initialized 276.82/204.55 [2019-03-28 12:37:34,163 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 276.82/204.55 [2019-03-28 12:37:34,163 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:37:31" (1/5) ... 276.82/204.55 [2019-03-28 12:37:34,164 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f1cc486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:37:34, skipping insertion in model container 276.82/204.55 [2019-03-28 12:37:34,164 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 276.82/204.55 [2019-03-28 12:37:34,164 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:31" (2/5) ... 276.82/204.55 [2019-03-28 12:37:34,164 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f1cc486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:37:34, skipping insertion in model container 276.82/204.55 [2019-03-28 12:37:34,164 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 276.82/204.55 [2019-03-28 12:37:34,165 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:37:32" (3/5) ... 276.82/204.55 [2019-03-28 12:37:34,165 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f1cc486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:37:34, skipping insertion in model container 276.82/204.55 [2019-03-28 12:37:34,165 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 276.82/204.55 [2019-03-28 12:37:34,165 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:37:32" (4/5) ... 276.82/204.55 [2019-03-28 12:37:34,165 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f1cc486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:37:34, skipping insertion in model container 276.82/204.55 [2019-03-28 12:37:34,166 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 276.82/204.55 [2019-03-28 12:37:34,166 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:37:34" (5/5) ... 276.82/204.55 [2019-03-28 12:37:34,167 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 276.82/204.55 [2019-03-28 12:37:34,188 INFO L133 ementStrategyFactory]: Using default assertion order modulation 276.82/204.55 [2019-03-28 12:37:34,188 INFO L374 BuchiCegarLoop]: Interprodecural is true 276.82/204.55 [2019-03-28 12:37:34,188 INFO L375 BuchiCegarLoop]: Hoare is true 276.82/204.55 [2019-03-28 12:37:34,188 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 276.82/204.55 [2019-03-28 12:37:34,188 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 276.82/204.55 [2019-03-28 12:37:34,188 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 276.82/204.55 [2019-03-28 12:37:34,188 INFO L379 BuchiCegarLoop]: Difference is false 276.82/204.55 [2019-03-28 12:37:34,188 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 276.82/204.55 [2019-03-28 12:37:34,189 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 276.82/204.55 [2019-03-28 12:37:34,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states. 276.82/204.55 [2019-03-28 12:37:34,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 276.82/204.55 [2019-03-28 12:37:34,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 276.82/204.55 [2019-03-28 12:37:34,199 INFO L119 BuchiIsEmpty]: Starting construction of run 276.82/204.55 [2019-03-28 12:37:34,204 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 276.82/204.55 [2019-03-28 12:37:34,204 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 276.82/204.55 [2019-03-28 12:37:34,204 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 276.82/204.55 [2019-03-28 12:37:34,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states. 276.82/204.55 [2019-03-28 12:37:34,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 276.82/204.55 [2019-03-28 12:37:34,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 276.82/204.55 [2019-03-28 12:37:34,207 INFO L119 BuchiIsEmpty]: Starting construction of run 276.82/204.55 [2019-03-28 12:37:34,207 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 276.82/204.55 [2019-03-28 12:37:34,208 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 276.82/204.55 [2019-03-28 12:37:34,214 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue [121] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 12#L-1true [186] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~id~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~maxId~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~id~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~maxId~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_1, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_1|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~maxId~0.base, ULTIMATE.start_main_~tmp~0.offset, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~tmp~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~id~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~maxId~0.offset, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~id~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 22#L8true [255] L8-->L9: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_14) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19) v_ULTIMATE.start_main_~id~0.offset_14 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_20|) (<= (+ v_ULTIMATE.start_main_~id~0.offset_14 4) (select |v_#length_34| v_ULTIMATE.start_main_~id~0.base_19)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~id~0.base_19))) InVars {ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 38#L9true [256] L9-->L11: Formula: (and (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~maxId~0.base_13)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_10) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_10 4) (select |v_#length_35| v_ULTIMATE.start_main_~maxId~0.base_13)) (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13) v_ULTIMATE.start_main_~maxId~0.offset_10 |v_ULTIMATE.start_main_#t~nondet3_5|)))) InVars {ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 28#L11true [122] L11-->L11-1: Formula: (and (= (select |v_#valid_10| v_ULTIMATE.start_main_~id~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~id~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~id~0.base_7) v_ULTIMATE.start_main_~id~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~id~0.base_7))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #valid=|v_#valid_10|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 25#L11-1true [200] L11-1-->L11-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 10#L11-2true [101] L11-2-->L11-7: Formula: (not |v_ULTIMATE.start_main_#t~short7_5|) InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_5|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_5|} AuxVars[] AssignedVars[] 18#L11-7true [206] L11-7-->L13: Formula: (and (= |v_#valid_16| (store |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1)) |v_ULTIMATE.start_main_#t~short7_7| (= 0 (select |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2|)) (= v_ULTIMATE.start_main_~tmp~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (= (store |v_#length_15| |v_ULTIMATE.start_main_#t~malloc8.base_2| 4) |v_#length_14|) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_2|) (> |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (= v_ULTIMATE.start_main_~tmp~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_15|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_7|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_2, #valid=|v_#valid_16|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #length=|v_#length_14|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_6|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_~tmp~0.base, ULTIMATE.start_main_~tmp~0.offset, #valid, ULTIMATE.start_main_#t~malloc8.offset, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4] 51#L13true [146] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~id~0.offset_10 4) (select |v_#length_16| v_ULTIMATE.start_main_~id~0.base_13)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_10) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~id~0.base_13) v_ULTIMATE.start_main_~id~0.offset_10)) (= (select |v_#valid_18| v_ULTIMATE.start_main_~id~0.base_13) 1)) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #valid=|v_#valid_18|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 49#L13-1true [259] L13-1-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_15) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_15 4) (select |v_#length_36| v_ULTIMATE.start_main_~tmp~0.base_21)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21) v_ULTIMATE.start_main_~tmp~0.offset_15 (+ |v_ULTIMATE.start_main_#t~mem9_6| 1))) |v_#memory_int_24|) (= (select |v_#valid_47| v_ULTIMATE.start_main_~tmp~0.base_21) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_36|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 5#L18-1true 276.82/204.55 [2019-03-28 12:37:34,214 INFO L796 eck$LassoCheckResult]: Loop: 5#L18-1true [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 15#L14-1true [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 14#L14-2true [231] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|) (> |v_ULTIMATE.start_main_#t~nondet12_5| 0)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 19#L15true [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 32#L15-1true [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 31#L15-2true [176] L15-2-->L18: Formula: (> |v_ULTIMATE.start_main_#t~mem13_6| |v_ULTIMATE.start_main_#t~mem14_6|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_6|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_5|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 8#L18true [94] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_13) (= 1 (select |v_#valid_34| v_ULTIMATE.start_main_~tmp~0.base_18)) (= (store |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18 (store (select |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18) v_ULTIMATE.start_main_~tmp~0.offset_13 0)) |v_#memory_int_18|) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_main_~tmp~0.base_18))) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} OutVars{#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} AuxVars[] AssignedVars[#memory_int] 5#L18-1true 276.82/204.55 [2019-03-28 12:37:34,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:34,216 INFO L82 PathProgramCache]: Analyzing trace with hash 4021835, now seen corresponding path program 1 times 276.82/204.55 [2019-03-28 12:37:34,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:34,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:34,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:34,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:34,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:34,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 276.82/204.55 [2019-03-28 12:37:34,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 276.82/204.55 [2019-03-28 12:37:34,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 276.82/204.55 [2019-03-28 12:37:34,239 INFO L799 eck$LassoCheckResult]: stem already infeasible 276.82/204.55 [2019-03-28 12:37:34,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:34,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1518903088, now seen corresponding path program 1 times 276.82/204.55 [2019-03-28 12:37:34,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:34,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:34,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:34,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:34,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:34,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 276.82/204.55 [2019-03-28 12:37:34,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 276.82/204.55 [2019-03-28 12:37:34,392 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. 276.82/204.55 [2019-03-28 12:37:34,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 276.82/204.55 [2019-03-28 12:37:34,501 INFO L93 Difference]: Finished difference Result 52 states and 92 transitions. 276.82/204.55 [2019-03-28 12:37:34,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 276.82/204.55 [2019-03-28 12:37:34,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 92 transitions. 276.82/204.55 [2019-03-28 12:37:34,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 276.82/204.55 [2019-03-28 12:37:34,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 24 states and 36 transitions. 276.82/204.55 [2019-03-28 12:37:34,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 276.82/204.55 [2019-03-28 12:37:34,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 276.82/204.55 [2019-03-28 12:37:34,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 36 transitions. 276.82/204.55 [2019-03-28 12:37:34,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 276.82/204.55 [2019-03-28 12:37:34,509 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. 276.82/204.55 [2019-03-28 12:37:34,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 36 transitions. 276.82/204.55 [2019-03-28 12:37:34,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. 276.82/204.55 [2019-03-28 12:37:34,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 276.82/204.55 [2019-03-28 12:37:34,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. 276.82/204.55 [2019-03-28 12:37:34,512 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 34 transitions. 276.82/204.55 [2019-03-28 12:37:34,512 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 34 transitions. 276.82/204.55 [2019-03-28 12:37:34,512 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 276.82/204.55 [2019-03-28 12:37:34,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 34 transitions. 276.82/204.55 [2019-03-28 12:37:34,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 276.82/204.55 [2019-03-28 12:37:34,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 276.82/204.55 [2019-03-28 12:37:34,513 INFO L119 BuchiIsEmpty]: Starting construction of run 276.82/204.55 [2019-03-28 12:37:34,514 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 276.82/204.55 [2019-03-28 12:37:34,514 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 276.82/204.55 [2019-03-28 12:37:34,515 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRY [121] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 126#L-1 [186] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~id~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~maxId~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~id~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~maxId~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_1, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_1|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~maxId~0.base, ULTIMATE.start_main_~tmp~0.offset, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~tmp~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~id~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~maxId~0.offset, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~id~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 122#L8 [255] L8-->L9: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_14) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19) v_ULTIMATE.start_main_~id~0.offset_14 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_20|) (<= (+ v_ULTIMATE.start_main_~id~0.offset_14 4) (select |v_#length_34| v_ULTIMATE.start_main_~id~0.base_19)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~id~0.base_19))) InVars {ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 123#L9 [256] L9-->L11: Formula: (and (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~maxId~0.base_13)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_10) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_10 4) (select |v_#length_35| v_ULTIMATE.start_main_~maxId~0.base_13)) (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13) v_ULTIMATE.start_main_~maxId~0.offset_10 |v_ULTIMATE.start_main_#t~nondet3_5|)))) InVars {ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 124#L11 [122] L11-->L11-1: Formula: (and (= (select |v_#valid_10| v_ULTIMATE.start_main_~id~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~id~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~id~0.base_7) v_ULTIMATE.start_main_~id~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~id~0.base_7))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #valid=|v_#valid_10|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 127#L11-1 [199] L11-1-->L11-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~mem4_3|) (not |v_ULTIMATE.start_main_#t~short7_2|)) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 128#L11-2 [101] L11-2-->L11-7: Formula: (not |v_ULTIMATE.start_main_#t~short7_5|) InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_5|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_5|} AuxVars[] AssignedVars[] 117#L11-7 [206] L11-7-->L13: Formula: (and (= |v_#valid_16| (store |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1)) |v_ULTIMATE.start_main_#t~short7_7| (= 0 (select |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2|)) (= v_ULTIMATE.start_main_~tmp~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (= (store |v_#length_15| |v_ULTIMATE.start_main_#t~malloc8.base_2| 4) |v_#length_14|) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_2|) (> |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (= v_ULTIMATE.start_main_~tmp~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_15|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_7|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_2, #valid=|v_#valid_16|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #length=|v_#length_14|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_6|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_~tmp~0.base, ULTIMATE.start_main_~tmp~0.offset, #valid, ULTIMATE.start_main_#t~malloc8.offset, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4] 133#L13 [146] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~id~0.offset_10 4) (select |v_#length_16| v_ULTIMATE.start_main_~id~0.base_13)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_10) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~id~0.base_13) v_ULTIMATE.start_main_~id~0.offset_10)) (= (select |v_#valid_18| v_ULTIMATE.start_main_~id~0.base_13) 1)) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #valid=|v_#valid_18|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 130#L13-1 [259] L13-1-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_15) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_15 4) (select |v_#length_36| v_ULTIMATE.start_main_~tmp~0.base_21)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21) v_ULTIMATE.start_main_~tmp~0.offset_15 (+ |v_ULTIMATE.start_main_#t~mem9_6| 1))) |v_#memory_int_24|) (= (select |v_#valid_47| v_ULTIMATE.start_main_~tmp~0.base_21) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_36|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 112#L18-1 276.82/204.55 [2019-03-28 12:37:34,516 INFO L796 eck$LassoCheckResult]: Loop: 112#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 118#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 131#L14-2 [231] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|) (> |v_ULTIMATE.start_main_#t~nondet12_5| 0)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 113#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 114#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 132#L15-2 [176] L15-2-->L18: Formula: (> |v_ULTIMATE.start_main_#t~mem13_6| |v_ULTIMATE.start_main_#t~mem14_6|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_6|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_5|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 120#L18 [94] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_13) (= 1 (select |v_#valid_34| v_ULTIMATE.start_main_~tmp~0.base_18)) (= (store |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18 (store (select |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18) v_ULTIMATE.start_main_~tmp~0.offset_13 0)) |v_#memory_int_18|) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_main_~tmp~0.base_18))) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} OutVars{#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} AuxVars[] AssignedVars[#memory_int] 112#L18-1 276.82/204.55 [2019-03-28 12:37:34,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:34,516 INFO L82 PathProgramCache]: Analyzing trace with hash 3098314, now seen corresponding path program 1 times 276.82/204.55 [2019-03-28 12:37:34,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:34,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:34,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:34,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:34,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:34,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 276.82/204.55 [2019-03-28 12:37:34,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 276.82/204.55 [2019-03-28 12:37:34,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 276.82/204.55 [2019-03-28 12:37:34,540 INFO L799 eck$LassoCheckResult]: stem already infeasible 276.82/204.55 [2019-03-28 12:37:34,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:34,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1518903088, now seen corresponding path program 2 times 276.82/204.55 [2019-03-28 12:37:34,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:34,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:34,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:34,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:34,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:34,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 276.82/204.55 [2019-03-28 12:37:34,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 276.82/204.55 [2019-03-28 12:37:34,646 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. cyclomatic complexity: 12 Second operand 3 states. 276.82/204.55 [2019-03-28 12:37:34,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 276.82/204.55 [2019-03-28 12:37:34,676 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. 276.82/204.55 [2019-03-28 12:37:34,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 276.82/204.55 [2019-03-28 12:37:34,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 33 transitions. 276.82/204.55 [2019-03-28 12:37:34,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 276.82/204.55 [2019-03-28 12:37:34,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 30 transitions. 276.82/204.55 [2019-03-28 12:37:34,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 276.82/204.55 [2019-03-28 12:37:34,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 276.82/204.55 [2019-03-28 12:37:34,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. 276.82/204.55 [2019-03-28 12:37:34,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 276.82/204.55 [2019-03-28 12:37:34,679 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. 276.82/204.55 [2019-03-28 12:37:34,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. 276.82/204.55 [2019-03-28 12:37:34,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 276.82/204.55 [2019-03-28 12:37:34,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 276.82/204.55 [2019-03-28 12:37:34,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. 276.82/204.55 [2019-03-28 12:37:34,681 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. 276.82/204.55 [2019-03-28 12:37:34,682 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. 276.82/204.55 [2019-03-28 12:37:34,682 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 276.82/204.55 [2019-03-28 12:37:34,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. 276.82/204.55 [2019-03-28 12:37:34,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 276.82/204.55 [2019-03-28 12:37:34,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 276.82/204.55 [2019-03-28 12:37:34,683 INFO L119 BuchiIsEmpty]: Starting construction of run 276.82/204.55 [2019-03-28 12:37:34,683 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 276.82/204.55 [2019-03-28 12:37:34,683 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 276.82/204.55 [2019-03-28 12:37:34,684 INFO L794 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY [121] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 179#L-1 [186] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~id~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~maxId~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~id~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~maxId~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_1, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_1|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~maxId~0.base, ULTIMATE.start_main_~tmp~0.offset, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~tmp~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~id~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~maxId~0.offset, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~id~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 174#L8 [255] L8-->L9: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_14) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19) v_ULTIMATE.start_main_~id~0.offset_14 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_20|) (<= (+ v_ULTIMATE.start_main_~id~0.offset_14 4) (select |v_#length_34| v_ULTIMATE.start_main_~id~0.base_19)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~id~0.base_19))) InVars {ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 175#L9 [256] L9-->L11: Formula: (and (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~maxId~0.base_13)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_10) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_10 4) (select |v_#length_35| v_ULTIMATE.start_main_~maxId~0.base_13)) (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13) v_ULTIMATE.start_main_~maxId~0.offset_10 |v_ULTIMATE.start_main_#t~nondet3_5|)))) InVars {ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 177#L11 [122] L11-->L11-1: Formula: (and (= (select |v_#valid_10| v_ULTIMATE.start_main_~id~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~id~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~id~0.base_7) v_ULTIMATE.start_main_~id~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~id~0.base_7))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #valid=|v_#valid_10|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 180#L11-1 [200] L11-1-->L11-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 178#L11-2 [100] L11-2-->L11-3: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 176#L11-3 [97] L11-3-->L11-4: Formula: (and (= (select |v_#valid_12| v_ULTIMATE.start_main_~id~0.base_10) 1) (<= (+ v_ULTIMATE.start_main_~id~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~id~0.base_10)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~id~0.base_10) v_ULTIMATE.start_main_~id~0.offset_8))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #valid=|v_#valid_12|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 172#L11-4 [91] L11-4-->L11-5: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~maxId~0.base_7) v_ULTIMATE.start_main_~maxId~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_6 4) (select |v_#length_12| v_ULTIMATE.start_main_~maxId~0.base_7)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_6) (= 1 (select |v_#valid_14| v_ULTIMATE.start_main_~maxId~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 169#L11-5 [216] L11-5-->L11-7: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< |v_ULTIMATE.start_main_#t~mem5_3| |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 170#L11-7 [206] L11-7-->L13: Formula: (and (= |v_#valid_16| (store |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1)) |v_ULTIMATE.start_main_#t~short7_7| (= 0 (select |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2|)) (= v_ULTIMATE.start_main_~tmp~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (= (store |v_#length_15| |v_ULTIMATE.start_main_#t~malloc8.base_2| 4) |v_#length_14|) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_2|) (> |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (= v_ULTIMATE.start_main_~tmp~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_15|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_7|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_2, #valid=|v_#valid_16|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #length=|v_#length_14|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_6|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_~tmp~0.base, ULTIMATE.start_main_~tmp~0.offset, #valid, ULTIMATE.start_main_#t~malloc8.offset, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4] 185#L13 [146] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~id~0.offset_10 4) (select |v_#length_16| v_ULTIMATE.start_main_~id~0.base_13)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_10) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~id~0.base_13) v_ULTIMATE.start_main_~id~0.offset_10)) (= (select |v_#valid_18| v_ULTIMATE.start_main_~id~0.base_13) 1)) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #valid=|v_#valid_18|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 182#L13-1 [259] L13-1-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_15) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_15 4) (select |v_#length_36| v_ULTIMATE.start_main_~tmp~0.base_21)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21) v_ULTIMATE.start_main_~tmp~0.offset_15 (+ |v_ULTIMATE.start_main_#t~mem9_6| 1))) |v_#memory_int_24|) (= (select |v_#valid_47| v_ULTIMATE.start_main_~tmp~0.base_21) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_36|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 165#L18-1 276.82/204.55 [2019-03-28 12:37:34,685 INFO L796 eck$LassoCheckResult]: Loop: 165#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 171#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 183#L14-2 [231] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|) (> |v_ULTIMATE.start_main_#t~nondet12_5| 0)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 166#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 167#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 184#L15-2 [176] L15-2-->L18: Formula: (> |v_ULTIMATE.start_main_#t~mem13_6| |v_ULTIMATE.start_main_#t~mem14_6|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_6|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_5|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 173#L18 [94] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_13) (= 1 (select |v_#valid_34| v_ULTIMATE.start_main_~tmp~0.base_18)) (= (store |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18 (store (select |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18) v_ULTIMATE.start_main_~tmp~0.offset_13 0)) |v_#memory_int_18|) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_main_~tmp~0.base_18))) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} OutVars{#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} AuxVars[] AssignedVars[#memory_int] 165#L18-1 276.82/204.55 [2019-03-28 12:37:34,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:34,685 INFO L82 PathProgramCache]: Analyzing trace with hash -209583564, now seen corresponding path program 1 times 276.82/204.55 [2019-03-28 12:37:34,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:34,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:34,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:34,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:34,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:34,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:34,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1518903088, now seen corresponding path program 3 times 276.82/204.55 [2019-03-28 12:37:34,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:34,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:34,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:34,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:34,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:34,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:34,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1157385629, now seen corresponding path program 1 times 276.82/204.55 [2019-03-28 12:37:34,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:34,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:34,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:34,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:34,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:34,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 276.82/204.55 [2019-03-28 12:37:34,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 276.82/204.55 [2019-03-28 12:37:34,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 276.82/204.55 [2019-03-28 12:37:35,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. 276.82/204.55 [2019-03-28 12:37:35,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 276.82/204.55 [2019-03-28 12:37:35,027 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 9 Second operand 12 states. 276.82/204.55 [2019-03-28 12:37:35,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 276.82/204.55 [2019-03-28 12:37:35,354 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. 276.82/204.55 [2019-03-28 12:37:35,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 276.82/204.55 [2019-03-28 12:37:35,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 41 transitions. 276.82/204.55 [2019-03-28 12:37:35,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 276.82/204.55 [2019-03-28 12:37:35,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 41 transitions. 276.82/204.55 [2019-03-28 12:37:35,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 276.82/204.55 [2019-03-28 12:37:35,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 276.82/204.55 [2019-03-28 12:37:35,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. 276.82/204.55 [2019-03-28 12:37:35,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 276.82/204.55 [2019-03-28 12:37:35,357 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. 276.82/204.55 [2019-03-28 12:37:35,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. 276.82/204.55 [2019-03-28 12:37:35,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. 276.82/204.55 [2019-03-28 12:37:35,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 276.82/204.55 [2019-03-28 12:37:35,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. 276.82/204.55 [2019-03-28 12:37:35,359 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. 276.82/204.55 [2019-03-28 12:37:35,359 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. 276.82/204.55 [2019-03-28 12:37:35,360 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 276.82/204.55 [2019-03-28 12:37:35,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. 276.82/204.55 [2019-03-28 12:37:35,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 276.82/204.55 [2019-03-28 12:37:35,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 276.82/204.55 [2019-03-28 12:37:35,361 INFO L119 BuchiIsEmpty]: Starting construction of run 276.82/204.55 [2019-03-28 12:37:35,361 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 276.82/204.55 [2019-03-28 12:37:35,361 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 276.82/204.55 [2019-03-28 12:37:35,363 INFO L794 eck$LassoCheckResult]: Stem: 266#ULTIMATE.startENTRY [121] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 264#L-1 [186] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~id~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~maxId~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~id~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~maxId~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_1, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_1|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~maxId~0.base, ULTIMATE.start_main_~tmp~0.offset, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~tmp~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~id~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~maxId~0.offset, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~id~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 259#L8 [255] L8-->L9: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_14) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19) v_ULTIMATE.start_main_~id~0.offset_14 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_20|) (<= (+ v_ULTIMATE.start_main_~id~0.offset_14 4) (select |v_#length_34| v_ULTIMATE.start_main_~id~0.base_19)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~id~0.base_19))) InVars {ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 260#L9 [256] L9-->L11: Formula: (and (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~maxId~0.base_13)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_10) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_10 4) (select |v_#length_35| v_ULTIMATE.start_main_~maxId~0.base_13)) (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13) v_ULTIMATE.start_main_~maxId~0.offset_10 |v_ULTIMATE.start_main_#t~nondet3_5|)))) InVars {ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 262#L11 [122] L11-->L11-1: Formula: (and (= (select |v_#valid_10| v_ULTIMATE.start_main_~id~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~id~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~id~0.base_7) v_ULTIMATE.start_main_~id~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~id~0.base_7))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #valid=|v_#valid_10|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 265#L11-1 [200] L11-1-->L11-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 263#L11-2 [100] L11-2-->L11-3: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 261#L11-3 [97] L11-3-->L11-4: Formula: (and (= (select |v_#valid_12| v_ULTIMATE.start_main_~id~0.base_10) 1) (<= (+ v_ULTIMATE.start_main_~id~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~id~0.base_10)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~id~0.base_10) v_ULTIMATE.start_main_~id~0.offset_8))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #valid=|v_#valid_12|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 257#L11-4 [91] L11-4-->L11-5: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~maxId~0.base_7) v_ULTIMATE.start_main_~maxId~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_6 4) (select |v_#length_12| v_ULTIMATE.start_main_~maxId~0.base_7)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_6) (= 1 (select |v_#valid_14| v_ULTIMATE.start_main_~maxId~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 254#L11-5 [216] L11-5-->L11-7: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< |v_ULTIMATE.start_main_#t~mem5_3| |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 255#L11-7 [206] L11-7-->L13: Formula: (and (= |v_#valid_16| (store |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1)) |v_ULTIMATE.start_main_#t~short7_7| (= 0 (select |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2|)) (= v_ULTIMATE.start_main_~tmp~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (= (store |v_#length_15| |v_ULTIMATE.start_main_#t~malloc8.base_2| 4) |v_#length_14|) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_2|) (> |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (= v_ULTIMATE.start_main_~tmp~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_15|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_7|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_2, #valid=|v_#valid_16|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #length=|v_#length_14|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_6|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_~tmp~0.base, ULTIMATE.start_main_~tmp~0.offset, #valid, ULTIMATE.start_main_#t~malloc8.offset, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4] 270#L13 [146] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~id~0.offset_10 4) (select |v_#length_16| v_ULTIMATE.start_main_~id~0.base_13)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_10) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~id~0.base_13) v_ULTIMATE.start_main_~id~0.offset_10)) (= (select |v_#valid_18| v_ULTIMATE.start_main_~id~0.base_13) 1)) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #valid=|v_#valid_18|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 267#L13-1 [259] L13-1-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_15) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_15 4) (select |v_#length_36| v_ULTIMATE.start_main_~tmp~0.base_21)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21) v_ULTIMATE.start_main_~tmp~0.offset_15 (+ |v_ULTIMATE.start_main_#t~mem9_6| 1))) |v_#memory_int_24|) (= (select |v_#valid_47| v_ULTIMATE.start_main_~tmp~0.base_21) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_36|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 268#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 276#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 275#L14-2 [234] L14-2-->L15: Formula: (and (> |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|) (> |v_ULTIMATE.start_main_#t~nondet12_5| 0)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 274#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 273#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 271#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 253#L16 276.82/204.55 [2019-03-28 12:37:35,363 INFO L796 eck$LassoCheckResult]: Loop: 253#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 251#L16-1 [260] L16-1-->L18-1: Formula: (and (= (select |v_#valid_48| v_ULTIMATE.start_main_~tmp~0.base_22) 1) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~tmp~0.base_22)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_16) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22) v_ULTIMATE.start_main_~tmp~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_26|)) InVars {ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 252#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 256#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 269#L14-2 [231] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|) (> |v_ULTIMATE.start_main_#t~nondet12_5| 0)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 249#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 250#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 272#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 253#L16 276.82/204.55 [2019-03-28 12:37:35,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:35,364 INFO L82 PathProgramCache]: Analyzing trace with hash -239670324, now seen corresponding path program 1 times 276.82/204.55 [2019-03-28 12:37:35,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:35,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:35,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:35,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:35,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 276.82/204.55 [2019-03-28 12:37:35,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 276.82/204.55 [2019-03-28 12:37:35,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 276.82/204.55 [2019-03-28 12:37:35,459 INFO L799 eck$LassoCheckResult]: stem already infeasible 276.82/204.55 [2019-03-28 12:37:35,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:35,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1248795962, now seen corresponding path program 1 times 276.82/204.55 [2019-03-28 12:37:35,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:35,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:35,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:35,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:35,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:35,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 276.82/204.55 [2019-03-28 12:37:35,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 276.82/204.55 [2019-03-28 12:37:35,570 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. cyclomatic complexity: 12 Second operand 9 states. 276.82/204.55 [2019-03-28 12:37:35,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 276.82/204.55 [2019-03-28 12:37:35,806 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. 276.82/204.55 [2019-03-28 12:37:35,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 276.82/204.55 [2019-03-28 12:37:35,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 97 transitions. 276.82/204.55 [2019-03-28 12:37:35,808 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 27 276.82/204.55 [2019-03-28 12:37:35,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 73 states and 97 transitions. 276.82/204.55 [2019-03-28 12:37:35,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 276.82/204.55 [2019-03-28 12:37:35,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 276.82/204.55 [2019-03-28 12:37:35,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 97 transitions. 276.82/204.55 [2019-03-28 12:37:35,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 276.82/204.55 [2019-03-28 12:37:35,810 INFO L706 BuchiCegarLoop]: Abstraction has 73 states and 97 transitions. 276.82/204.55 [2019-03-28 12:37:35,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 97 transitions. 276.82/204.55 [2019-03-28 12:37:35,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 42. 276.82/204.55 [2019-03-28 12:37:35,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 276.82/204.55 [2019-03-28 12:37:35,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. 276.82/204.55 [2019-03-28 12:37:35,813 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. 276.82/204.55 [2019-03-28 12:37:35,814 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. 276.82/204.55 [2019-03-28 12:37:35,814 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 276.82/204.55 [2019-03-28 12:37:35,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 55 transitions. 276.82/204.55 [2019-03-28 12:37:35,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 276.82/204.55 [2019-03-28 12:37:35,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 276.82/204.55 [2019-03-28 12:37:35,815 INFO L119 BuchiIsEmpty]: Starting construction of run 276.82/204.55 [2019-03-28 12:37:35,816 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 276.82/204.55 [2019-03-28 12:37:35,816 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 276.82/204.55 [2019-03-28 12:37:35,817 INFO L794 eck$LassoCheckResult]: Stem: 395#ULTIMATE.startENTRY [121] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 391#L-1 [186] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~id~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~maxId~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~id~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~maxId~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_1, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_1|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~maxId~0.base, ULTIMATE.start_main_~tmp~0.offset, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~tmp~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~id~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~maxId~0.offset, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~id~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 392#L8 [255] L8-->L9: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_14) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19) v_ULTIMATE.start_main_~id~0.offset_14 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_20|) (<= (+ v_ULTIMATE.start_main_~id~0.offset_14 4) (select |v_#length_34| v_ULTIMATE.start_main_~id~0.base_19)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~id~0.base_19))) InVars {ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 387#L9 [256] L9-->L11: Formula: (and (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~maxId~0.base_13)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_10) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_10 4) (select |v_#length_35| v_ULTIMATE.start_main_~maxId~0.base_13)) (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13) v_ULTIMATE.start_main_~maxId~0.offset_10 |v_ULTIMATE.start_main_#t~nondet3_5|)))) InVars {ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 388#L11 [122] L11-->L11-1: Formula: (and (= (select |v_#valid_10| v_ULTIMATE.start_main_~id~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~id~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~id~0.base_7) v_ULTIMATE.start_main_~id~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~id~0.base_7))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #valid=|v_#valid_10|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 393#L11-1 [200] L11-1-->L11-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 394#L11-2 [100] L11-2-->L11-3: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 385#L11-3 [97] L11-3-->L11-4: Formula: (and (= (select |v_#valid_12| v_ULTIMATE.start_main_~id~0.base_10) 1) (<= (+ v_ULTIMATE.start_main_~id~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~id~0.base_10)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~id~0.base_10) v_ULTIMATE.start_main_~id~0.offset_8))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #valid=|v_#valid_12|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 386#L11-4 [91] L11-4-->L11-5: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~maxId~0.base_7) v_ULTIMATE.start_main_~maxId~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_6 4) (select |v_#length_12| v_ULTIMATE.start_main_~maxId~0.base_7)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_6) (= 1 (select |v_#valid_14| v_ULTIMATE.start_main_~maxId~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 377#L11-5 [216] L11-5-->L11-7: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< |v_ULTIMATE.start_main_#t~mem5_3| |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 378#L11-7 [205] L11-7-->L13: Formula: (and (= |v_#valid_16| (store |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1)) |v_ULTIMATE.start_main_#t~short7_7| (= 0 (select |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2|)) (= v_ULTIMATE.start_main_~tmp~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (= (store |v_#length_15| |v_ULTIMATE.start_main_#t~malloc8.base_2| 4) |v_#length_14|) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_2|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (= v_ULTIMATE.start_main_~tmp~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_15|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_7|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_2, #valid=|v_#valid_16|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #length=|v_#length_14|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_6|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_~tmp~0.base, ULTIMATE.start_main_~tmp~0.offset, #valid, ULTIMATE.start_main_#t~malloc8.offset, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4] 402#L13 [146] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~id~0.offset_10 4) (select |v_#length_16| v_ULTIMATE.start_main_~id~0.base_13)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_10) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~id~0.base_13) v_ULTIMATE.start_main_~id~0.offset_10)) (= (select |v_#valid_18| v_ULTIMATE.start_main_~id~0.base_13) 1)) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #valid=|v_#valid_18|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 403#L13-1 [259] L13-1-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_15) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_15 4) (select |v_#length_36| v_ULTIMATE.start_main_~tmp~0.base_21)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21) v_ULTIMATE.start_main_~tmp~0.offset_15 (+ |v_ULTIMATE.start_main_#t~mem9_6| 1))) |v_#memory_int_24|) (= (select |v_#valid_47| v_ULTIMATE.start_main_~tmp~0.base_21) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_36|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 411#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 410#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 409#L14-2 [234] L14-2-->L15: Formula: (and (> |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|) (> |v_ULTIMATE.start_main_#t~nondet12_5| 0)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 372#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 373#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 404#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 376#L16 276.82/204.55 [2019-03-28 12:37:35,817 INFO L796 eck$LassoCheckResult]: Loop: 376#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 374#L16-1 [260] L16-1-->L18-1: Formula: (and (= (select |v_#valid_48| v_ULTIMATE.start_main_~tmp~0.base_22) 1) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~tmp~0.base_22)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_16) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22) v_ULTIMATE.start_main_~tmp~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_26|)) InVars {ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 375#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 379#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 400#L14-2 [231] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|) (> |v_ULTIMATE.start_main_#t~nondet12_5| 0)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 401#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 407#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 406#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 376#L16 276.82/204.55 [2019-03-28 12:37:35,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:35,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1567784139, now seen corresponding path program 1 times 276.82/204.55 [2019-03-28 12:37:35,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:35,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:35,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:35,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:35,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 276.82/204.55 [2019-03-28 12:37:35,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 276.82/204.55 [2019-03-28 12:37:35,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 276.82/204.55 [2019-03-28 12:37:35,901 INFO L799 eck$LassoCheckResult]: stem already infeasible 276.82/204.55 [2019-03-28 12:37:35,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:35,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1248795962, now seen corresponding path program 2 times 276.82/204.55 [2019-03-28 12:37:35,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:35,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:35,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:35,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:35,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:36,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 276.82/204.55 [2019-03-28 12:37:36,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 276.82/204.55 [2019-03-28 12:37:36,016 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. cyclomatic complexity: 14 Second operand 9 states. 276.82/204.55 [2019-03-28 12:37:36,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 276.82/204.55 [2019-03-28 12:37:36,249 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. 276.82/204.55 [2019-03-28 12:37:36,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 276.82/204.55 [2019-03-28 12:37:36,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 55 transitions. 276.82/204.55 [2019-03-28 12:37:36,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 276.82/204.55 [2019-03-28 12:37:36,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 55 transitions. 276.82/204.55 [2019-03-28 12:37:36,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 276.82/204.55 [2019-03-28 12:37:36,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 276.82/204.55 [2019-03-28 12:37:36,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 55 transitions. 276.82/204.55 [2019-03-28 12:37:36,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 276.82/204.55 [2019-03-28 12:37:36,253 INFO L706 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. 276.82/204.55 [2019-03-28 12:37:36,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 55 transitions. 276.82/204.55 [2019-03-28 12:37:36,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. 276.82/204.55 [2019-03-28 12:37:36,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 276.82/204.55 [2019-03-28 12:37:36,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. 276.82/204.55 [2019-03-28 12:37:36,255 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. 276.82/204.55 [2019-03-28 12:37:36,255 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. 276.82/204.55 [2019-03-28 12:37:36,255 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 276.82/204.55 [2019-03-28 12:37:36,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. 276.82/204.55 [2019-03-28 12:37:36,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 276.82/204.55 [2019-03-28 12:37:36,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 276.82/204.55 [2019-03-28 12:37:36,256 INFO L119 BuchiIsEmpty]: Starting construction of run 276.82/204.55 [2019-03-28 12:37:36,257 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 276.82/204.55 [2019-03-28 12:37:36,257 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 276.82/204.55 [2019-03-28 12:37:36,258 INFO L794 eck$LassoCheckResult]: Stem: 498#ULTIMATE.startENTRY [121] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 496#L-1 [186] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~id~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~maxId~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~id~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~maxId~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_1, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_1|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~maxId~0.base, ULTIMATE.start_main_~tmp~0.offset, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~tmp~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~id~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~maxId~0.offset, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~id~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 491#L8 [255] L8-->L9: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_14) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19) v_ULTIMATE.start_main_~id~0.offset_14 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_20|) (<= (+ v_ULTIMATE.start_main_~id~0.offset_14 4) (select |v_#length_34| v_ULTIMATE.start_main_~id~0.base_19)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~id~0.base_19))) InVars {ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 492#L9 [256] L9-->L11: Formula: (and (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~maxId~0.base_13)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_10) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_10 4) (select |v_#length_35| v_ULTIMATE.start_main_~maxId~0.base_13)) (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13) v_ULTIMATE.start_main_~maxId~0.offset_10 |v_ULTIMATE.start_main_#t~nondet3_5|)))) InVars {ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 494#L11 [122] L11-->L11-1: Formula: (and (= (select |v_#valid_10| v_ULTIMATE.start_main_~id~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~id~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~id~0.base_7) v_ULTIMATE.start_main_~id~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~id~0.base_7))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #valid=|v_#valid_10|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 497#L11-1 [200] L11-1-->L11-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 495#L11-2 [100] L11-2-->L11-3: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 493#L11-3 [97] L11-3-->L11-4: Formula: (and (= (select |v_#valid_12| v_ULTIMATE.start_main_~id~0.base_10) 1) (<= (+ v_ULTIMATE.start_main_~id~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~id~0.base_10)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~id~0.base_10) v_ULTIMATE.start_main_~id~0.offset_8))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #valid=|v_#valid_12|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 489#L11-4 [91] L11-4-->L11-5: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~maxId~0.base_7) v_ULTIMATE.start_main_~maxId~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_6 4) (select |v_#length_12| v_ULTIMATE.start_main_~maxId~0.base_7)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_6) (= 1 (select |v_#valid_14| v_ULTIMATE.start_main_~maxId~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 485#L11-5 [216] L11-5-->L11-7: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< |v_ULTIMATE.start_main_#t~mem5_3| |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 486#L11-7 [206] L11-7-->L13: Formula: (and (= |v_#valid_16| (store |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1)) |v_ULTIMATE.start_main_#t~short7_7| (= 0 (select |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2|)) (= v_ULTIMATE.start_main_~tmp~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (= (store |v_#length_15| |v_ULTIMATE.start_main_#t~malloc8.base_2| 4) |v_#length_14|) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_2|) (> |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (= v_ULTIMATE.start_main_~tmp~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_15|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_7|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_2, #valid=|v_#valid_16|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #length=|v_#length_14|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_6|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_~tmp~0.base, ULTIMATE.start_main_~tmp~0.offset, #valid, ULTIMATE.start_main_#t~malloc8.offset, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4] 501#L13 [146] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~id~0.offset_10 4) (select |v_#length_16| v_ULTIMATE.start_main_~id~0.base_13)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_10) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~id~0.base_13) v_ULTIMATE.start_main_~id~0.offset_10)) (= (select |v_#valid_18| v_ULTIMATE.start_main_~id~0.base_13) 1)) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #valid=|v_#valid_18|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 499#L13-1 [259] L13-1-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_15) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_15 4) (select |v_#length_36| v_ULTIMATE.start_main_~tmp~0.base_21)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21) v_ULTIMATE.start_main_~tmp~0.offset_15 (+ |v_ULTIMATE.start_main_#t~mem9_6| 1))) |v_#memory_int_24|) (= (select |v_#valid_47| v_ULTIMATE.start_main_~tmp~0.base_21) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_36|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 487#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 488#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 500#L14-2 [233] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 480#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 481#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 502#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 484#L16 276.82/204.55 [2019-03-28 12:37:36,258 INFO L796 eck$LassoCheckResult]: Loop: 484#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 482#L16-1 [260] L16-1-->L18-1: Formula: (and (= (select |v_#valid_48| v_ULTIMATE.start_main_~tmp~0.base_22) 1) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~tmp~0.base_22)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_16) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22) v_ULTIMATE.start_main_~tmp~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_26|)) InVars {ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 483#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 507#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 506#L14-2 [231] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|) (> |v_ULTIMATE.start_main_#t~nondet12_5| 0)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 505#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 504#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 503#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 484#L16 276.82/204.55 [2019-03-28 12:37:36,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:36,259 INFO L82 PathProgramCache]: Analyzing trace with hash -239700115, now seen corresponding path program 1 times 276.82/204.55 [2019-03-28 12:37:36,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:36,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:36,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:36,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:36,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:36,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:36,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1248795962, now seen corresponding path program 3 times 276.82/204.55 [2019-03-28 12:37:36,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:36,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:36,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:36,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:36,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:36,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:36,300 INFO L82 PathProgramCache]: Analyzing trace with hash -2103613274, now seen corresponding path program 1 times 276.82/204.55 [2019-03-28 12:37:36,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:36,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:36,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:36,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:36,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:36,995 WARN L188 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 117 276.82/204.55 [2019-03-28 12:37:37,147 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 79 276.82/204.55 [2019-03-28 12:37:37,162 INFO L216 LassoAnalysis]: Preferences: 276.82/204.55 [2019-03-28 12:37:37,163 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 276.82/204.55 [2019-03-28 12:37:37,163 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 276.82/204.55 [2019-03-28 12:37:37,163 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 276.82/204.55 [2019-03-28 12:37:37,163 INFO L127 ssoRankerPreferences]: Use exernal solver: false 276.82/204.55 [2019-03-28 12:37:37,163 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 276.82/204.55 [2019-03-28 12:37:37,164 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 276.82/204.55 [2019-03-28 12:37:37,164 INFO L130 ssoRankerPreferences]: Path of dumped script: 276.82/204.55 [2019-03-28 12:37:37,164 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso 276.82/204.55 [2019-03-28 12:37:37,164 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 276.82/204.55 [2019-03-28 12:37:37,164 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 276.82/204.55 [2019-03-28 12:37:37,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:37,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:37,486 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 276.82/204.55 [2019-03-28 12:37:37,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:37,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:37,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:37,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:37,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:37,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:37,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:37,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:37,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:37,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:37,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:37,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:37,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:37,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:37,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:37,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:38,016 INFO L300 LassoAnalysis]: Preprocessing complete. 276.82/204.55 [2019-03-28 12:37:38,023 INFO L497 LassoAnalysis]: Using template 'affine'. 276.82/204.55 [2019-03-28 12:37:38,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.82/204.55 Termination analysis: LINEAR_WITH_GUESSES 276.82/204.55 Number of strict supporting invariants: 0 276.82/204.55 Number of non-strict supporting invariants: 1 276.82/204.55 Consider only non-deceasing supporting invariants: true 276.82/204.55 Simplify termination arguments: true 276.82/204.55 Simplify supporting invariants: trueOverapproximate stem: false 276.82/204.55 [2019-03-28 12:37:38,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.82/204.55 [2019-03-28 12:37:38,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.82/204.55 [2019-03-28 12:37:38,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.82/204.55 [2019-03-28 12:37:38,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.82/204.55 [2019-03-28 12:37:38,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.82/204.55 [2019-03-28 12:37:38,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.82/204.55 [2019-03-28 12:37:38,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.82/204.55 [2019-03-28 12:37:38,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.82/204.55 [2019-03-28 12:37:38,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.82/204.55 Termination analysis: LINEAR_WITH_GUESSES 276.82/204.55 Number of strict supporting invariants: 0 276.82/204.55 Number of non-strict supporting invariants: 1 276.82/204.55 Consider only non-deceasing supporting invariants: true 276.82/204.55 Simplify termination arguments: true 276.82/204.55 Simplify supporting invariants: trueOverapproximate stem: false 276.82/204.55 [2019-03-28 12:37:38,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.82/204.55 [2019-03-28 12:37:38,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.82/204.55 [2019-03-28 12:37:38,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.82/204.55 [2019-03-28 12:37:38,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.82/204.55 [2019-03-28 12:37:38,039 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.82/204.55 [2019-03-28 12:37:38,039 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.82/204.55 [2019-03-28 12:37:38,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.82/204.55 [2019-03-28 12:37:38,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.82/204.55 Termination analysis: LINEAR_WITH_GUESSES 276.82/204.55 Number of strict supporting invariants: 0 276.82/204.55 Number of non-strict supporting invariants: 1 276.82/204.55 Consider only non-deceasing supporting invariants: true 276.82/204.55 Simplify termination arguments: true 276.82/204.55 Simplify supporting invariants: trueOverapproximate stem: false 276.82/204.55 [2019-03-28 12:37:38,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.82/204.55 [2019-03-28 12:37:38,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.82/204.55 [2019-03-28 12:37:38,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.82/204.55 [2019-03-28 12:37:38,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.82/204.55 [2019-03-28 12:37:38,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.82/204.55 [2019-03-28 12:37:38,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.82/204.55 [2019-03-28 12:37:38,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.82/204.55 [2019-03-28 12:37:38,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.82/204.55 Termination analysis: LINEAR_WITH_GUESSES 276.82/204.55 Number of strict supporting invariants: 0 276.82/204.55 Number of non-strict supporting invariants: 1 276.82/204.55 Consider only non-deceasing supporting invariants: true 276.82/204.55 Simplify termination arguments: true 276.82/204.55 Simplify supporting invariants: trueOverapproximate stem: false 276.82/204.55 [2019-03-28 12:37:38,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.82/204.55 [2019-03-28 12:37:38,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.82/204.55 [2019-03-28 12:37:38,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.82/204.55 [2019-03-28 12:37:38,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.82/204.55 [2019-03-28 12:37:38,063 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.82/204.55 [2019-03-28 12:37:38,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.82/204.55 [2019-03-28 12:37:38,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.82/204.55 [2019-03-28 12:37:38,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.82/204.55 Termination analysis: LINEAR_WITH_GUESSES 276.82/204.55 Number of strict supporting invariants: 0 276.82/204.55 Number of non-strict supporting invariants: 1 276.82/204.55 Consider only non-deceasing supporting invariants: true 276.82/204.55 Simplify termination arguments: true 276.82/204.55 Simplify supporting invariants: trueOverapproximate stem: false 276.82/204.55 [2019-03-28 12:37:38,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.82/204.55 [2019-03-28 12:37:38,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.82/204.55 [2019-03-28 12:37:38,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.82/204.55 [2019-03-28 12:37:38,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.82/204.55 [2019-03-28 12:37:38,071 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.82/204.55 [2019-03-28 12:37:38,071 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.82/204.55 [2019-03-28 12:37:38,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.82/204.55 [2019-03-28 12:37:38,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.82/204.55 Termination analysis: LINEAR_WITH_GUESSES 276.82/204.55 Number of strict supporting invariants: 0 276.82/204.55 Number of non-strict supporting invariants: 1 276.82/204.55 Consider only non-deceasing supporting invariants: true 276.82/204.55 Simplify termination arguments: true 276.82/204.55 Simplify supporting invariants: trueOverapproximate stem: false 276.82/204.55 [2019-03-28 12:37:38,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.82/204.55 [2019-03-28 12:37:38,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.82/204.55 [2019-03-28 12:37:38,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.82/204.55 [2019-03-28 12:37:38,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.82/204.55 [2019-03-28 12:37:38,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.82/204.55 [2019-03-28 12:37:38,083 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.82/204.55 [2019-03-28 12:37:38,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.82/204.55 [2019-03-28 12:37:38,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.82/204.55 Termination analysis: LINEAR_WITH_GUESSES 276.82/204.55 Number of strict supporting invariants: 0 276.82/204.55 Number of non-strict supporting invariants: 1 276.82/204.55 Consider only non-deceasing supporting invariants: true 276.82/204.55 Simplify termination arguments: true 276.82/204.55 Simplify supporting invariants: trueOverapproximate stem: false 276.82/204.55 [2019-03-28 12:37:38,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.82/204.55 [2019-03-28 12:37:38,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.82/204.55 [2019-03-28 12:37:38,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.82/204.55 [2019-03-28 12:37:38,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.82/204.55 [2019-03-28 12:37:38,120 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.82/204.55 [2019-03-28 12:37:38,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.82/204.55 [2019-03-28 12:37:38,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.82/204.55 [2019-03-28 12:37:38,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.82/204.55 Termination analysis: LINEAR_WITH_GUESSES 276.82/204.55 Number of strict supporting invariants: 0 276.82/204.55 Number of non-strict supporting invariants: 1 276.82/204.55 Consider only non-deceasing supporting invariants: true 276.82/204.55 Simplify termination arguments: true 276.82/204.55 Simplify supporting invariants: trueOverapproximate stem: false 276.82/204.55 [2019-03-28 12:37:38,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.82/204.55 [2019-03-28 12:37:38,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.82/204.55 [2019-03-28 12:37:38,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.82/204.55 [2019-03-28 12:37:38,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.82/204.55 [2019-03-28 12:37:38,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.82/204.55 [2019-03-28 12:37:38,129 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.82/204.55 [2019-03-28 12:37:38,146 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 276.82/204.55 [2019-03-28 12:37:38,164 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 276.82/204.55 [2019-03-28 12:37:38,164 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. 276.82/204.55 [2019-03-28 12:37:38,167 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 276.82/204.55 [2019-03-28 12:37:38,168 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 276.82/204.55 [2019-03-28 12:37:38,168 INFO L518 LassoAnalysis]: Proved termination. 276.82/204.55 [2019-03-28 12:37:38,169 INFO L520 LassoAnalysis]: Termination argument consisting of: 276.82/204.55 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0.base) ULTIMATE.start_main_~maxId~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0.base) ULTIMATE.start_main_~tmp~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0.base) ULTIMATE.start_main_~maxId~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0.base) ULTIMATE.start_main_~tmp~0.offset)_1 276.82/204.55 Supporting invariants [] 276.82/204.55 [2019-03-28 12:37:38,248 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 276.82/204.55 [2019-03-28 12:37:38,252 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 276.82/204.55 [2019-03-28 12:37:38,253 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 276.82/204.55 [2019-03-28 12:37:38,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:38,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjunts are in the unsatisfiable core 276.82/204.55 [2019-03-28 12:37:38,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.82/204.55 [2019-03-28 12:37:38,372 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:38,373 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 276.82/204.55 [2019-03-28 12:37:38,373 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:38,377 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:38,377 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:38,377 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:6 276.82/204.55 [2019-03-28 12:37:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:38,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 8 conjunts are in the unsatisfiable core 276.82/204.55 [2019-03-28 12:37:38,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.82/204.55 [2019-03-28 12:37:38,413 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 276.82/204.55 [2019-03-28 12:37:38,416 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:38,422 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:38,423 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:38,423 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 276.82/204.55 [2019-03-28 12:37:38,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 276.82/204.55 [2019-03-28 12:37:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:38,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 8 conjunts are in the unsatisfiable core 276.82/204.55 [2019-03-28 12:37:38,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.82/204.55 [2019-03-28 12:37:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:38,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 8 conjunts are in the unsatisfiable core 276.82/204.55 [2019-03-28 12:37:38,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.82/204.55 [2019-03-28 12:37:38,731 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 28 276.82/204.55 [2019-03-28 12:37:38,732 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:38,741 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:38,742 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:38,742 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:23 276.82/204.55 [2019-03-28 12:37:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:38,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 8 conjunts are in the unsatisfiable core 276.82/204.55 [2019-03-28 12:37:38,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.82/204.55 [2019-03-28 12:37:38,819 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 28 276.82/204.55 [2019-03-28 12:37:38,820 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:38,831 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:38,831 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:38,832 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:23 276.82/204.55 [2019-03-28 12:37:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:38,846 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 276.82/204.55 [2019-03-28 12:37:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:38,857 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 276.82/204.55 [2019-03-28 12:37:38,857 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 8 predicates after loop cannibalization 276.82/204.55 [2019-03-28 12:37:38,861 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 8 loop predicates 276.82/204.55 [2019-03-28 12:37:38,862 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 28 states and 37 transitions. cyclomatic complexity: 10 Second operand 8 states. 276.82/204.55 [2019-03-28 12:37:39,348 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 28 states and 37 transitions. cyclomatic complexity: 10. Second operand 8 states. Result 183 states and 267 transitions. Complement of second has 101 states. 276.82/204.55 [2019-03-28 12:37:39,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 3 stem states 14 non-accepting loop states 2 accepting loop states 276.82/204.55 [2019-03-28 12:37:39,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 276.82/204.55 [2019-03-28 12:37:39,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 71 transitions. 276.82/204.55 [2019-03-28 12:37:39,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 71 transitions. Stem has 19 letters. Loop has 8 letters. 276.82/204.55 [2019-03-28 12:37:39,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. 276.82/204.55 [2019-03-28 12:37:39,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 71 transitions. Stem has 27 letters. Loop has 8 letters. 276.82/204.55 [2019-03-28 12:37:39,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. 276.82/204.55 [2019-03-28 12:37:39,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 71 transitions. Stem has 19 letters. Loop has 16 letters. 276.82/204.55 [2019-03-28 12:37:39,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. 276.82/204.55 [2019-03-28 12:37:39,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 267 transitions. 276.82/204.55 [2019-03-28 12:37:39,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 276.82/204.55 [2019-03-28 12:37:39,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 92 states and 131 transitions. 276.82/204.55 [2019-03-28 12:37:39,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 276.82/204.55 [2019-03-28 12:37:39,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 276.82/204.55 [2019-03-28 12:37:39,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 131 transitions. 276.82/204.55 [2019-03-28 12:37:39,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 276.82/204.55 [2019-03-28 12:37:39,367 INFO L706 BuchiCegarLoop]: Abstraction has 92 states and 131 transitions. 276.82/204.55 [2019-03-28 12:37:39,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 131 transitions. 276.82/204.55 [2019-03-28 12:37:39,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 42. 276.82/204.55 [2019-03-28 12:37:39,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 276.82/204.55 [2019-03-28 12:37:39,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. 276.82/204.55 [2019-03-28 12:37:39,370 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 59 transitions. 276.82/204.55 [2019-03-28 12:37:39,370 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 59 transitions. 276.82/204.55 [2019-03-28 12:37:39,370 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 276.82/204.55 [2019-03-28 12:37:39,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 59 transitions. 276.82/204.55 [2019-03-28 12:37:39,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 276.82/204.55 [2019-03-28 12:37:39,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 276.82/204.55 [2019-03-28 12:37:39,371 INFO L119 BuchiIsEmpty]: Starting construction of run 276.82/204.55 [2019-03-28 12:37:39,372 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 276.82/204.55 [2019-03-28 12:37:39,372 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] 276.82/204.55 [2019-03-28 12:37:39,373 INFO L794 eck$LassoCheckResult]: Stem: 1117#ULTIMATE.startENTRY [121] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 1115#L-1 [186] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~id~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~maxId~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~id~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~maxId~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_1, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_1|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~maxId~0.base, ULTIMATE.start_main_~tmp~0.offset, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~tmp~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~id~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~maxId~0.offset, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~id~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 1110#L8 [255] L8-->L9: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_14) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19) v_ULTIMATE.start_main_~id~0.offset_14 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_20|) (<= (+ v_ULTIMATE.start_main_~id~0.offset_14 4) (select |v_#length_34| v_ULTIMATE.start_main_~id~0.base_19)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~id~0.base_19))) InVars {ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 1111#L9 [256] L9-->L11: Formula: (and (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~maxId~0.base_13)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_10) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_10 4) (select |v_#length_35| v_ULTIMATE.start_main_~maxId~0.base_13)) (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13) v_ULTIMATE.start_main_~maxId~0.offset_10 |v_ULTIMATE.start_main_#t~nondet3_5|)))) InVars {ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 1113#L11 [122] L11-->L11-1: Formula: (and (= (select |v_#valid_10| v_ULTIMATE.start_main_~id~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~id~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~id~0.base_7) v_ULTIMATE.start_main_~id~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~id~0.base_7))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #valid=|v_#valid_10|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 1116#L11-1 [200] L11-1-->L11-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 1114#L11-2 [100] L11-2-->L11-3: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 1112#L11-3 [97] L11-3-->L11-4: Formula: (and (= (select |v_#valid_12| v_ULTIMATE.start_main_~id~0.base_10) 1) (<= (+ v_ULTIMATE.start_main_~id~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~id~0.base_10)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~id~0.base_10) v_ULTIMATE.start_main_~id~0.offset_8))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #valid=|v_#valid_12|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1107#L11-4 [91] L11-4-->L11-5: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~maxId~0.base_7) v_ULTIMATE.start_main_~maxId~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_6 4) (select |v_#length_12| v_ULTIMATE.start_main_~maxId~0.base_7)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_6) (= 1 (select |v_#valid_14| v_ULTIMATE.start_main_~maxId~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 1103#L11-5 [216] L11-5-->L11-7: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< |v_ULTIMATE.start_main_#t~mem5_3| |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 1104#L11-7 [206] L11-7-->L13: Formula: (and (= |v_#valid_16| (store |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1)) |v_ULTIMATE.start_main_#t~short7_7| (= 0 (select |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2|)) (= v_ULTIMATE.start_main_~tmp~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (= (store |v_#length_15| |v_ULTIMATE.start_main_#t~malloc8.base_2| 4) |v_#length_14|) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_2|) (> |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (= v_ULTIMATE.start_main_~tmp~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_15|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_7|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_2, #valid=|v_#valid_16|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #length=|v_#length_14|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_6|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_~tmp~0.base, ULTIMATE.start_main_~tmp~0.offset, #valid, ULTIMATE.start_main_#t~malloc8.offset, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4] 1124#L13 [146] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~id~0.offset_10 4) (select |v_#length_16| v_ULTIMATE.start_main_~id~0.base_13)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_10) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~id~0.base_13) v_ULTIMATE.start_main_~id~0.offset_10)) (= (select |v_#valid_18| v_ULTIMATE.start_main_~id~0.base_13) 1)) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #valid=|v_#valid_18|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 1120#L13-1 [259] L13-1-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_15) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_15 4) (select |v_#length_36| v_ULTIMATE.start_main_~tmp~0.base_21)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21) v_ULTIMATE.start_main_~tmp~0.offset_15 (+ |v_ULTIMATE.start_main_#t~mem9_6| 1))) |v_#memory_int_24|) (= (select |v_#valid_47| v_ULTIMATE.start_main_~tmp~0.base_21) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_36|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 1121#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 1132#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 1129#L14-2 [233] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 1130#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 1134#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 1125#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 1101#L16 276.82/204.55 [2019-03-28 12:37:39,374 INFO L796 eck$LassoCheckResult]: Loop: 1101#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 1097#L16-1 [260] L16-1-->L18-1: Formula: (and (= (select |v_#valid_48| v_ULTIMATE.start_main_~tmp~0.base_22) 1) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~tmp~0.base_22)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_16) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22) v_ULTIMATE.start_main_~tmp~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_26|)) InVars {ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 1098#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 1105#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 1118#L14-2 [231] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|) (> |v_ULTIMATE.start_main_#t~nondet12_5| 0)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 1093#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 1094#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 1122#L15-2 [176] L15-2-->L18: Formula: (> |v_ULTIMATE.start_main_#t~mem13_6| |v_ULTIMATE.start_main_#t~mem14_6|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_6|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_5|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 1108#L18 [94] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_13) (= 1 (select |v_#valid_34| v_ULTIMATE.start_main_~tmp~0.base_18)) (= (store |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18 (store (select |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18) v_ULTIMATE.start_main_~tmp~0.offset_13 0)) |v_#memory_int_18|) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_main_~tmp~0.base_18))) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} OutVars{#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} AuxVars[] AssignedVars[#memory_int] 1109#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 1133#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 1131#L14-2 [231] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|) (> |v_ULTIMATE.start_main_#t~nondet12_5| 0)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 1128#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 1126#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 1127#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 1101#L16 276.82/204.55 [2019-03-28 12:37:39,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:39,374 INFO L82 PathProgramCache]: Analyzing trace with hash -239700115, now seen corresponding path program 2 times 276.82/204.55 [2019-03-28 12:37:39,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:39,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:39,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:39,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:39,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:39,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:39,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1221064301, now seen corresponding path program 1 times 276.82/204.55 [2019-03-28 12:37:39,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:39,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:39,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:39,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:39,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:39,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:39,424 INFO L82 PathProgramCache]: Analyzing trace with hash -335660671, now seen corresponding path program 1 times 276.82/204.55 [2019-03-28 12:37:39,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:39,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:39,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:39,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:39,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:39,567 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. 276.82/204.55 [2019-03-28 12:37:39,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 276.82/204.55 [2019-03-28 12:37:39,567 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 276.82/204.55 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 276.82/204.55 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 276.82/204.55 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 276.82/204.55 [2019-03-28 12:37:39,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:39,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 18 conjunts are in the unsatisfiable core 276.82/204.55 [2019-03-28 12:37:39,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.82/204.55 [2019-03-28 12:37:39,648 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 276.82/204.55 [2019-03-28 12:37:39,648 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:39,655 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:39,655 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:39,656 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 276.82/204.55 [2019-03-28 12:37:39,661 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 276.82/204.55 [2019-03-28 12:37:39,662 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:39,668 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:39,669 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:39,669 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:18, output treesize:3 276.82/204.55 [2019-03-28 12:37:39,718 INFO L189 IndexEqualityManager]: detected not equals via solver 276.82/204.55 [2019-03-28 12:37:39,720 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 276.82/204.55 [2019-03-28 12:37:39,720 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:39,729 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:39,730 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:39,730 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 276.82/204.55 [2019-03-28 12:37:39,738 INFO L189 IndexEqualityManager]: detected not equals via solver 276.82/204.55 [2019-03-28 12:37:39,739 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 276.82/204.55 [2019-03-28 12:37:39,740 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:39,749 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:39,750 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:39,750 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 276.82/204.55 [2019-03-28 12:37:39,757 INFO L189 IndexEqualityManager]: detected not equals via solver 276.82/204.55 [2019-03-28 12:37:39,759 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 276.82/204.55 [2019-03-28 12:37:39,759 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:39,769 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:39,770 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:39,770 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 276.82/204.55 [2019-03-28 12:37:39,871 INFO L189 IndexEqualityManager]: detected not equals via solver 276.82/204.55 [2019-03-28 12:37:39,872 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 276.82/204.55 [2019-03-28 12:37:39,873 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:39,881 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:39,882 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:39,882 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:7 276.82/204.55 [2019-03-28 12:37:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. 276.82/204.55 [2019-03-28 12:37:39,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 276.82/204.55 [2019-03-28 12:37:39,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 276.82/204.55 [2019-03-28 12:37:40,144 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 276.82/204.55 [2019-03-28 12:37:40,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. 276.82/204.55 [2019-03-28 12:37:40,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 276.82/204.55 [2019-03-28 12:37:40,184 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. cyclomatic complexity: 18 Second operand 16 states. 276.82/204.55 [2019-03-28 12:37:41,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 276.82/204.55 [2019-03-28 12:37:41,048 INFO L93 Difference]: Finished difference Result 192 states and 261 transitions. 276.82/204.55 [2019-03-28 12:37:41,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 276.82/204.55 [2019-03-28 12:37:41,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 261 transitions. 276.82/204.55 [2019-03-28 12:37:41,070 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 121 276.82/204.55 [2019-03-28 12:37:41,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 192 states and 261 transitions. 276.82/204.55 [2019-03-28 12:37:41,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 276.82/204.55 [2019-03-28 12:37:41,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 276.82/204.55 [2019-03-28 12:37:41,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 261 transitions. 276.82/204.55 [2019-03-28 12:37:41,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 276.82/204.55 [2019-03-28 12:37:41,073 INFO L706 BuchiCegarLoop]: Abstraction has 192 states and 261 transitions. 276.82/204.55 [2019-03-28 12:37:41,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 261 transitions. 276.82/204.55 [2019-03-28 12:37:41,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 82. 276.82/204.55 [2019-03-28 12:37:41,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. 276.82/204.55 [2019-03-28 12:37:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 111 transitions. 276.82/204.55 [2019-03-28 12:37:41,079 INFO L729 BuchiCegarLoop]: Abstraction has 82 states and 111 transitions. 276.82/204.55 [2019-03-28 12:37:41,079 INFO L609 BuchiCegarLoop]: Abstraction has 82 states and 111 transitions. 276.82/204.55 [2019-03-28 12:37:41,079 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 276.82/204.55 [2019-03-28 12:37:41,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 111 transitions. 276.82/204.55 [2019-03-28 12:37:41,080 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 276.82/204.55 [2019-03-28 12:37:41,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 276.82/204.55 [2019-03-28 12:37:41,081 INFO L119 BuchiIsEmpty]: Starting construction of run 276.82/204.55 [2019-03-28 12:37:41,081 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 276.82/204.55 [2019-03-28 12:37:41,081 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] 276.82/204.55 [2019-03-28 12:37:41,083 INFO L794 eck$LassoCheckResult]: Stem: 1499#ULTIMATE.startENTRY [121] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 1496#L-1 [186] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~id~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~maxId~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~id~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~maxId~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_1, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_1|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~maxId~0.base, ULTIMATE.start_main_~tmp~0.offset, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~tmp~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~id~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~maxId~0.offset, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~id~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 1492#L8 [255] L8-->L9: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_14) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19) v_ULTIMATE.start_main_~id~0.offset_14 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_20|) (<= (+ v_ULTIMATE.start_main_~id~0.offset_14 4) (select |v_#length_34| v_ULTIMATE.start_main_~id~0.base_19)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~id~0.base_19))) InVars {ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 1493#L9 [256] L9-->L11: Formula: (and (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~maxId~0.base_13)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_10) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_10 4) (select |v_#length_35| v_ULTIMATE.start_main_~maxId~0.base_13)) (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13) v_ULTIMATE.start_main_~maxId~0.offset_10 |v_ULTIMATE.start_main_#t~nondet3_5|)))) InVars {ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 1494#L11 [122] L11-->L11-1: Formula: (and (= (select |v_#valid_10| v_ULTIMATE.start_main_~id~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~id~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~id~0.base_7) v_ULTIMATE.start_main_~id~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~id~0.base_7))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #valid=|v_#valid_10|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 1498#L11-1 [200] L11-1-->L11-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 1495#L11-2 [100] L11-2-->L11-3: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 1491#L11-3 [97] L11-3-->L11-4: Formula: (and (= (select |v_#valid_12| v_ULTIMATE.start_main_~id~0.base_10) 1) (<= (+ v_ULTIMATE.start_main_~id~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~id~0.base_10)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~id~0.base_10) v_ULTIMATE.start_main_~id~0.offset_8))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #valid=|v_#valid_12|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1488#L11-4 [91] L11-4-->L11-5: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~maxId~0.base_7) v_ULTIMATE.start_main_~maxId~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_6 4) (select |v_#length_12| v_ULTIMATE.start_main_~maxId~0.base_7)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_6) (= 1 (select |v_#valid_14| v_ULTIMATE.start_main_~maxId~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 1483#L11-5 [216] L11-5-->L11-7: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< |v_ULTIMATE.start_main_#t~mem5_3| |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 1484#L11-7 [205] L11-7-->L13: Formula: (and (= |v_#valid_16| (store |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1)) |v_ULTIMATE.start_main_#t~short7_7| (= 0 (select |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2|)) (= v_ULTIMATE.start_main_~tmp~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (= (store |v_#length_15| |v_ULTIMATE.start_main_#t~malloc8.base_2| 4) |v_#length_14|) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_2|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (= v_ULTIMATE.start_main_~tmp~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_15|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_7|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_2, #valid=|v_#valid_16|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #length=|v_#length_14|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_6|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_~tmp~0.base, ULTIMATE.start_main_~tmp~0.offset, #valid, ULTIMATE.start_main_#t~malloc8.offset, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4] 1504#L13 [146] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~id~0.offset_10 4) (select |v_#length_16| v_ULTIMATE.start_main_~id~0.base_13)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_10) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~id~0.base_13) v_ULTIMATE.start_main_~id~0.offset_10)) (= (select |v_#valid_18| v_ULTIMATE.start_main_~id~0.base_13) 1)) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #valid=|v_#valid_18|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 1500#L13-1 [259] L13-1-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_15) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_15 4) (select |v_#length_36| v_ULTIMATE.start_main_~tmp~0.base_21)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21) v_ULTIMATE.start_main_~tmp~0.offset_15 (+ |v_ULTIMATE.start_main_#t~mem9_6| 1))) |v_#memory_int_24|) (= (select |v_#valid_47| v_ULTIMATE.start_main_~tmp~0.base_21) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_36|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 1485#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 1486#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 1523#L14-2 [233] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 1471#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 1472#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 1511#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 1526#L16 276.82/204.55 [2019-03-28 12:37:41,084 INFO L796 eck$LassoCheckResult]: Loop: 1526#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 1475#L16-1 [260] L16-1-->L18-1: Formula: (and (= (select |v_#valid_48| v_ULTIMATE.start_main_~tmp~0.base_22) 1) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~tmp~0.base_22)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_16) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22) v_ULTIMATE.start_main_~tmp~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_26|)) InVars {ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 1476#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 1518#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 1517#L14-2 [231] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|) (> |v_ULTIMATE.start_main_#t~nondet12_5| 0)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 1516#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 1514#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 1515#L15-2 [176] L15-2-->L18: Formula: (> |v_ULTIMATE.start_main_#t~mem13_6| |v_ULTIMATE.start_main_#t~mem14_6|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_6|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_5|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 1489#L18 [94] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_13) (= 1 (select |v_#valid_34| v_ULTIMATE.start_main_~tmp~0.base_18)) (= (store |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18 (store (select |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18) v_ULTIMATE.start_main_~tmp~0.offset_13 0)) |v_#memory_int_18|) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_main_~tmp~0.base_18))) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} OutVars{#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} AuxVars[] AssignedVars[#memory_int] 1490#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 1505#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 1506#L14-2 [231] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|) (> |v_ULTIMATE.start_main_#t~nondet12_5| 0)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 1522#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 1520#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 1521#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 1526#L16 276.82/204.55 [2019-03-28 12:37:41,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:41,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1567754348, now seen corresponding path program 1 times 276.82/204.55 [2019-03-28 12:37:41,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:41,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:41,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:41,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:41,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:41,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:41,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1221064301, now seen corresponding path program 2 times 276.82/204.55 [2019-03-28 12:37:41,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:41,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:41,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:41,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:41,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:41,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:41,129 INFO L82 PathProgramCache]: Analyzing trace with hash -268653918, now seen corresponding path program 1 times 276.82/204.55 [2019-03-28 12:37:41,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:41,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:41,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:41,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:41,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. 276.82/204.55 [2019-03-28 12:37:41,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 276.82/204.55 [2019-03-28 12:37:41,275 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 276.82/204.55 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 276.82/204.55 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 276.82/204.55 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 276.82/204.55 [2019-03-28 12:37:41,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:41,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 22 conjunts are in the unsatisfiable core 276.82/204.55 [2019-03-28 12:37:41,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.82/204.55 [2019-03-28 12:37:41,325 INFO L189 IndexEqualityManager]: detected not equals via solver 276.82/204.55 [2019-03-28 12:37:41,326 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 276.82/204.55 [2019-03-28 12:37:41,327 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:41,333 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:41,333 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:41,334 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 276.82/204.55 [2019-03-28 12:37:41,354 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 276.82/204.55 [2019-03-28 12:37:41,354 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:41,363 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:41,363 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:41,363 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 276.82/204.55 [2019-03-28 12:37:41,369 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 276.82/204.55 [2019-03-28 12:37:41,369 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:41,377 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:41,378 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:41,378 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:17 276.82/204.55 [2019-03-28 12:37:41,457 INFO L189 IndexEqualityManager]: detected not equals via solver 276.82/204.55 [2019-03-28 12:37:41,458 INFO L189 IndexEqualityManager]: detected not equals via solver 276.82/204.55 [2019-03-28 12:37:41,463 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:41,463 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 276.82/204.55 [2019-03-28 12:37:41,464 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:41,472 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:41,472 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:41,473 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 276.82/204.55 [2019-03-28 12:37:41,496 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 276.82/204.55 [2019-03-28 12:37:41,497 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:41,506 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:41,506 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:41,507 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 276.82/204.55 [2019-03-28 12:37:41,512 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 276.82/204.55 [2019-03-28 12:37:41,513 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:41,521 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:41,522 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:41,522 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 276.82/204.55 [2019-03-28 12:37:41,528 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 276.82/204.55 [2019-03-28 12:37:41,528 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:41,536 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:41,537 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:41,537 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 276.82/204.55 [2019-03-28 12:37:41,592 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 276.82/204.55 [2019-03-28 12:37:41,593 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:41,600 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:41,600 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:41,600 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:7 276.82/204.55 [2019-03-28 12:37:41,621 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. 276.82/204.55 [2019-03-28 12:37:41,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 276.82/204.55 [2019-03-28 12:37:41,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 276.82/204.55 [2019-03-28 12:37:41,859 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 276.82/204.55 [2019-03-28 12:37:41,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. 276.82/204.55 [2019-03-28 12:37:41,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 276.82/204.55 [2019-03-28 12:37:41,899 INFO L87 Difference]: Start difference. First operand 82 states and 111 transitions. cyclomatic complexity: 31 Second operand 18 states. 276.82/204.55 [2019-03-28 12:37:43,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 276.82/204.55 [2019-03-28 12:37:43,156 INFO L93 Difference]: Finished difference Result 169 states and 223 transitions. 276.82/204.55 [2019-03-28 12:37:43,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 276.82/204.55 [2019-03-28 12:37:43,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 223 transitions. 276.82/204.55 [2019-03-28 12:37:43,180 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 104 276.82/204.55 [2019-03-28 12:37:43,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 169 states and 223 transitions. 276.82/204.55 [2019-03-28 12:37:43,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 133 276.82/204.55 [2019-03-28 12:37:43,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 276.82/204.55 [2019-03-28 12:37:43,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 223 transitions. 276.82/204.55 [2019-03-28 12:37:43,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 276.82/204.55 [2019-03-28 12:37:43,183 INFO L706 BuchiCegarLoop]: Abstraction has 169 states and 223 transitions. 276.82/204.55 [2019-03-28 12:37:43,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 223 transitions. 276.82/204.55 [2019-03-28 12:37:43,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 42. 276.82/204.55 [2019-03-28 12:37:43,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 276.82/204.55 [2019-03-28 12:37:43,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. 276.82/204.55 [2019-03-28 12:37:43,186 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 57 transitions. 276.82/204.55 [2019-03-28 12:37:43,186 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 57 transitions. 276.82/204.55 [2019-03-28 12:37:43,186 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 276.82/204.55 [2019-03-28 12:37:43,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 57 transitions. 276.82/204.55 [2019-03-28 12:37:43,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 276.82/204.55 [2019-03-28 12:37:43,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 276.82/204.55 [2019-03-28 12:37:43,187 INFO L119 BuchiIsEmpty]: Starting construction of run 276.82/204.55 [2019-03-28 12:37:43,188 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 276.82/204.55 [2019-03-28 12:37:43,188 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] 276.82/204.55 [2019-03-28 12:37:43,189 INFO L794 eck$LassoCheckResult]: Stem: 1905#ULTIMATE.startENTRY [121] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 1903#L-1 [186] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~id~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~maxId~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~id~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~maxId~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_1, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_1|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~maxId~0.base, ULTIMATE.start_main_~tmp~0.offset, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~tmp~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~id~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~maxId~0.offset, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~id~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 1898#L8 [255] L8-->L9: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_14) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19) v_ULTIMATE.start_main_~id~0.offset_14 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_20|) (<= (+ v_ULTIMATE.start_main_~id~0.offset_14 4) (select |v_#length_34| v_ULTIMATE.start_main_~id~0.base_19)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~id~0.base_19))) InVars {ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 1899#L9 [256] L9-->L11: Formula: (and (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~maxId~0.base_13)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_10) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_10 4) (select |v_#length_35| v_ULTIMATE.start_main_~maxId~0.base_13)) (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13) v_ULTIMATE.start_main_~maxId~0.offset_10 |v_ULTIMATE.start_main_#t~nondet3_5|)))) InVars {ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 1901#L11 [122] L11-->L11-1: Formula: (and (= (select |v_#valid_10| v_ULTIMATE.start_main_~id~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~id~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~id~0.base_7) v_ULTIMATE.start_main_~id~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~id~0.base_7))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #valid=|v_#valid_10|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 1904#L11-1 [200] L11-1-->L11-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 1902#L11-2 [100] L11-2-->L11-3: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 1900#L11-3 [97] L11-3-->L11-4: Formula: (and (= (select |v_#valid_12| v_ULTIMATE.start_main_~id~0.base_10) 1) (<= (+ v_ULTIMATE.start_main_~id~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~id~0.base_10)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~id~0.base_10) v_ULTIMATE.start_main_~id~0.offset_8))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #valid=|v_#valid_12|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1895#L11-4 [91] L11-4-->L11-5: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~maxId~0.base_7) v_ULTIMATE.start_main_~maxId~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_6 4) (select |v_#length_12| v_ULTIMATE.start_main_~maxId~0.base_7)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_6) (= 1 (select |v_#valid_14| v_ULTIMATE.start_main_~maxId~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 1890#L11-5 [216] L11-5-->L11-7: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< |v_ULTIMATE.start_main_#t~mem5_3| |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 1891#L11-7 [206] L11-7-->L13: Formula: (and (= |v_#valid_16| (store |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1)) |v_ULTIMATE.start_main_#t~short7_7| (= 0 (select |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2|)) (= v_ULTIMATE.start_main_~tmp~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (= (store |v_#length_15| |v_ULTIMATE.start_main_#t~malloc8.base_2| 4) |v_#length_14|) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_2|) (> |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (= v_ULTIMATE.start_main_~tmp~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_15|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_7|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_2, #valid=|v_#valid_16|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #length=|v_#length_14|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_6|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_~tmp~0.base, ULTIMATE.start_main_~tmp~0.offset, #valid, ULTIMATE.start_main_#t~malloc8.offset, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4] 1911#L13 [146] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~id~0.offset_10 4) (select |v_#length_16| v_ULTIMATE.start_main_~id~0.base_13)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_10) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~id~0.base_13) v_ULTIMATE.start_main_~id~0.offset_10)) (= (select |v_#valid_18| v_ULTIMATE.start_main_~id~0.base_13) 1)) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #valid=|v_#valid_18|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 1908#L13-1 [259] L13-1-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_15) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_15 4) (select |v_#length_36| v_ULTIMATE.start_main_~tmp~0.base_21)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21) v_ULTIMATE.start_main_~tmp~0.offset_15 (+ |v_ULTIMATE.start_main_#t~mem9_6| 1))) |v_#memory_int_24|) (= (select |v_#valid_47| v_ULTIMATE.start_main_~tmp~0.base_21) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_36|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 1892#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 1893#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 1906#L14-2 [233] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 1880#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 1881#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 1909#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 1888#L16 276.82/204.55 [2019-03-28 12:37:43,189 INFO L796 eck$LassoCheckResult]: Loop: 1888#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 1884#L16-1 [260] L16-1-->L18-1: Formula: (and (= (select |v_#valid_48| v_ULTIMATE.start_main_~tmp~0.base_22) 1) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~tmp~0.base_22)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_16) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22) v_ULTIMATE.start_main_~tmp~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_26|)) InVars {ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 1885#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 1920#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 1918#L14-2 [231] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|) (> |v_ULTIMATE.start_main_#t~nondet12_5| 0)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 1916#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 1914#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 1912#L15-2 [176] L15-2-->L18: Formula: (> |v_ULTIMATE.start_main_#t~mem13_6| |v_ULTIMATE.start_main_#t~mem14_6|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_6|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_5|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 1896#L18 [94] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_13) (= 1 (select |v_#valid_34| v_ULTIMATE.start_main_~tmp~0.base_18)) (= (store |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18 (store (select |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18) v_ULTIMATE.start_main_~tmp~0.offset_13 0)) |v_#memory_int_18|) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_main_~tmp~0.base_18))) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} OutVars{#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} AuxVars[] AssignedVars[#memory_int] 1897#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 1921#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 1919#L14-2 [232] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (> |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 1917#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 1915#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 1913#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 1888#L16 276.82/204.55 [2019-03-28 12:37:43,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:43,190 INFO L82 PathProgramCache]: Analyzing trace with hash -239700115, now seen corresponding path program 3 times 276.82/204.55 [2019-03-28 12:37:43,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:43,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:43,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:43,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:43,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:43,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:43,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1221094092, now seen corresponding path program 1 times 276.82/204.55 [2019-03-28 12:37:43,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:43,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:43,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:43,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:43,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:43,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:43,229 INFO L82 PathProgramCache]: Analyzing trace with hash -335630880, now seen corresponding path program 1 times 276.82/204.55 [2019-03-28 12:37:43,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.55 [2019-03-28 12:37:43,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.55 [2019-03-28 12:37:43,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:43,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:43,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.55 [2019-03-28 12:37:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:43,380 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 80 276.82/204.55 [2019-03-28 12:37:43,888 WARN L188 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 117 276.82/204.55 [2019-03-28 12:37:44,024 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 79 276.82/204.55 [2019-03-28 12:37:44,028 INFO L216 LassoAnalysis]: Preferences: 276.82/204.55 [2019-03-28 12:37:44,028 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 276.82/204.55 [2019-03-28 12:37:44,028 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 276.82/204.55 [2019-03-28 12:37:44,028 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 276.82/204.55 [2019-03-28 12:37:44,028 INFO L127 ssoRankerPreferences]: Use exernal solver: false 276.82/204.55 [2019-03-28 12:37:44,028 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 276.82/204.55 [2019-03-28 12:37:44,028 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 276.82/204.55 [2019-03-28 12:37:44,028 INFO L130 ssoRankerPreferences]: Path of dumped script: 276.82/204.55 [2019-03-28 12:37:44,029 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Lasso 276.82/204.55 [2019-03-28 12:37:44,029 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 276.82/204.55 [2019-03-28 12:37:44,029 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 276.82/204.55 [2019-03-28 12:37:44,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:44,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:44,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:44,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:44,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:44,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:44,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:44,309 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 276.82/204.55 [2019-03-28 12:37:44,429 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 276.82/204.55 [2019-03-28 12:37:44,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:44,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:44,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:44,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:44,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:44,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:44,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:44,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:44,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:44,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:44,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.82/204.55 [2019-03-28 12:37:44,810 INFO L300 LassoAnalysis]: Preprocessing complete. 276.82/204.55 [2019-03-28 12:37:44,810 INFO L497 LassoAnalysis]: Using template 'affine'. 276.82/204.55 [2019-03-28 12:37:44,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.82/204.55 Termination analysis: LINEAR_WITH_GUESSES 276.82/204.55 Number of strict supporting invariants: 0 276.82/204.55 Number of non-strict supporting invariants: 1 276.82/204.55 Consider only non-deceasing supporting invariants: true 276.82/204.55 Simplify termination arguments: true 276.82/204.55 Simplify supporting invariants: trueOverapproximate stem: false 276.82/204.55 [2019-03-28 12:37:44,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.82/204.55 [2019-03-28 12:37:44,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.82/204.55 [2019-03-28 12:37:44,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.82/204.55 [2019-03-28 12:37:44,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.82/204.55 [2019-03-28 12:37:44,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.82/204.55 [2019-03-28 12:37:44,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.82/204.55 [2019-03-28 12:37:44,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.82/204.55 [2019-03-28 12:37:44,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.82/204.55 [2019-03-28 12:37:44,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.82/204.55 Termination analysis: LINEAR_WITH_GUESSES 276.82/204.55 Number of strict supporting invariants: 0 276.82/204.55 Number of non-strict supporting invariants: 1 276.82/204.55 Consider only non-deceasing supporting invariants: true 276.82/204.55 Simplify termination arguments: true 276.82/204.55 Simplify supporting invariants: trueOverapproximate stem: false 276.82/204.55 [2019-03-28 12:37:44,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.82/204.55 [2019-03-28 12:37:44,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.82/204.55 [2019-03-28 12:37:44,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.82/204.55 [2019-03-28 12:37:44,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.82/204.55 [2019-03-28 12:37:44,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.82/204.55 [2019-03-28 12:37:44,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.82/204.55 [2019-03-28 12:37:44,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.82/204.55 [2019-03-28 12:37:44,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.82/204.55 [2019-03-28 12:37:44,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.82/204.55 Termination analysis: LINEAR_WITH_GUESSES 276.82/204.55 Number of strict supporting invariants: 0 276.82/204.55 Number of non-strict supporting invariants: 1 276.82/204.55 Consider only non-deceasing supporting invariants: true 276.82/204.55 Simplify termination arguments: true 276.82/204.55 Simplify supporting invariants: trueOverapproximate stem: false 276.82/204.55 [2019-03-28 12:37:44,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.82/204.55 [2019-03-28 12:37:44,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.82/204.55 [2019-03-28 12:37:44,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.82/204.55 [2019-03-28 12:37:44,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.82/204.55 [2019-03-28 12:37:44,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.82/204.55 [2019-03-28 12:37:44,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.82/204.55 [2019-03-28 12:37:44,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.82/204.55 [2019-03-28 12:37:44,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.82/204.55 Termination analysis: LINEAR_WITH_GUESSES 276.82/204.55 Number of strict supporting invariants: 0 276.82/204.55 Number of non-strict supporting invariants: 1 276.82/204.55 Consider only non-deceasing supporting invariants: true 276.82/204.55 Simplify termination arguments: true 276.82/204.55 Simplify supporting invariants: trueOverapproximate stem: false 276.82/204.55 [2019-03-28 12:37:44,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.82/204.55 [2019-03-28 12:37:44,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.82/204.55 [2019-03-28 12:37:44,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.82/204.55 [2019-03-28 12:37:44,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.82/204.55 [2019-03-28 12:37:44,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.82/204.55 [2019-03-28 12:37:44,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.82/204.55 [2019-03-28 12:37:44,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.82/204.55 [2019-03-28 12:37:44,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.82/204.55 Termination analysis: LINEAR_WITH_GUESSES 276.82/204.55 Number of strict supporting invariants: 0 276.82/204.55 Number of non-strict supporting invariants: 1 276.82/204.55 Consider only non-deceasing supporting invariants: true 276.82/204.55 Simplify termination arguments: true 276.82/204.55 Simplify supporting invariants: trueOverapproximate stem: false 276.82/204.55 [2019-03-28 12:37:44,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.82/204.55 [2019-03-28 12:37:44,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.82/204.55 [2019-03-28 12:37:44,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.82/204.55 [2019-03-28 12:37:44,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.82/204.55 [2019-03-28 12:37:44,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.82/204.55 [2019-03-28 12:37:44,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.82/204.55 [2019-03-28 12:37:44,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.82/204.55 [2019-03-28 12:37:44,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.82/204.55 [2019-03-28 12:37:44,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.82/204.55 Termination analysis: LINEAR_WITH_GUESSES 276.82/204.55 Number of strict supporting invariants: 0 276.82/204.55 Number of non-strict supporting invariants: 1 276.82/204.55 Consider only non-deceasing supporting invariants: true 276.82/204.55 Simplify termination arguments: true 276.82/204.55 Simplify supporting invariants: trueOverapproximate stem: false 276.82/204.55 [2019-03-28 12:37:44,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.82/204.55 [2019-03-28 12:37:44,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.82/204.55 [2019-03-28 12:37:44,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.82/204.55 [2019-03-28 12:37:44,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.82/204.55 [2019-03-28 12:37:44,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.82/204.55 [2019-03-28 12:37:44,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.82/204.55 [2019-03-28 12:37:44,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.82/204.55 [2019-03-28 12:37:44,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.82/204.55 [2019-03-28 12:37:44,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.82/204.55 Termination analysis: LINEAR_WITH_GUESSES 276.82/204.55 Number of strict supporting invariants: 0 276.82/204.55 Number of non-strict supporting invariants: 1 276.82/204.55 Consider only non-deceasing supporting invariants: true 276.82/204.55 Simplify termination arguments: true 276.82/204.55 Simplify supporting invariants: trueOverapproximate stem: false 276.82/204.55 [2019-03-28 12:37:44,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.82/204.55 [2019-03-28 12:37:44,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.82/204.55 [2019-03-28 12:37:44,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.82/204.55 [2019-03-28 12:37:44,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.82/204.55 [2019-03-28 12:37:44,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.82/204.55 [2019-03-28 12:37:44,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.82/204.55 [2019-03-28 12:37:44,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.82/204.55 [2019-03-28 12:37:44,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.82/204.55 Termination analysis: LINEAR_WITH_GUESSES 276.82/204.55 Number of strict supporting invariants: 0 276.82/204.55 Number of non-strict supporting invariants: 1 276.82/204.55 Consider only non-deceasing supporting invariants: true 276.82/204.55 Simplify termination arguments: true 276.82/204.55 Simplify supporting invariants: trueOverapproximate stem: false 276.82/204.55 [2019-03-28 12:37:44,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.82/204.55 [2019-03-28 12:37:44,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.82/204.55 [2019-03-28 12:37:44,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.82/204.55 [2019-03-28 12:37:44,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.82/204.55 [2019-03-28 12:37:44,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.82/204.55 [2019-03-28 12:37:44,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.82/204.55 [2019-03-28 12:37:44,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.82/204.55 [2019-03-28 12:37:44,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.82/204.55 Termination analysis: LINEAR_WITH_GUESSES 276.82/204.55 Number of strict supporting invariants: 0 276.82/204.55 Number of non-strict supporting invariants: 1 276.82/204.55 Consider only non-deceasing supporting invariants: true 276.82/204.55 Simplify termination arguments: true 276.82/204.55 Simplify supporting invariants: trueOverapproximate stem: false 276.82/204.55 [2019-03-28 12:37:44,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.82/204.55 [2019-03-28 12:37:44,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.82/204.55 [2019-03-28 12:37:44,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.82/204.55 [2019-03-28 12:37:44,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.82/204.55 [2019-03-28 12:37:44,843 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.82/204.55 [2019-03-28 12:37:44,843 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.82/204.55 [2019-03-28 12:37:44,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.82/204.55 [2019-03-28 12:37:44,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.82/204.55 Termination analysis: LINEAR_WITH_GUESSES 276.82/204.55 Number of strict supporting invariants: 0 276.82/204.55 Number of non-strict supporting invariants: 1 276.82/204.55 Consider only non-deceasing supporting invariants: true 276.82/204.55 Simplify termination arguments: true 276.82/204.55 Simplify supporting invariants: trueOverapproximate stem: false 276.82/204.55 [2019-03-28 12:37:44,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.82/204.55 [2019-03-28 12:37:44,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.82/204.55 [2019-03-28 12:37:44,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.82/204.55 [2019-03-28 12:37:44,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.82/204.55 [2019-03-28 12:37:44,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.82/204.55 [2019-03-28 12:37:44,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.82/204.55 [2019-03-28 12:37:44,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.82/204.55 [2019-03-28 12:37:44,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.82/204.55 Termination analysis: LINEAR_WITH_GUESSES 276.82/204.55 Number of strict supporting invariants: 0 276.82/204.55 Number of non-strict supporting invariants: 1 276.82/204.55 Consider only non-deceasing supporting invariants: true 276.82/204.55 Simplify termination arguments: true 276.82/204.55 Simplify supporting invariants: trueOverapproximate stem: false 276.82/204.55 [2019-03-28 12:37:44,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.82/204.55 [2019-03-28 12:37:44,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.82/204.55 [2019-03-28 12:37:44,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.82/204.55 [2019-03-28 12:37:44,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.82/204.55 [2019-03-28 12:37:44,852 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.82/204.55 [2019-03-28 12:37:44,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.82/204.55 [2019-03-28 12:37:44,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.82/204.55 [2019-03-28 12:37:44,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.82/204.55 Termination analysis: LINEAR_WITH_GUESSES 276.82/204.55 Number of strict supporting invariants: 0 276.82/204.55 Number of non-strict supporting invariants: 1 276.82/204.55 Consider only non-deceasing supporting invariants: true 276.82/204.55 Simplify termination arguments: true 276.82/204.55 Simplify supporting invariants: trueOverapproximate stem: false 276.82/204.55 [2019-03-28 12:37:44,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.82/204.55 [2019-03-28 12:37:44,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.82/204.55 [2019-03-28 12:37:44,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.82/204.55 [2019-03-28 12:37:44,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.82/204.55 [2019-03-28 12:37:44,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.82/204.55 [2019-03-28 12:37:44,860 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.82/204.55 [2019-03-28 12:37:44,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.82/204.55 [2019-03-28 12:37:44,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.82/204.55 Termination analysis: LINEAR_WITH_GUESSES 276.82/204.55 Number of strict supporting invariants: 0 276.82/204.55 Number of non-strict supporting invariants: 1 276.82/204.55 Consider only non-deceasing supporting invariants: true 276.82/204.55 Simplify termination arguments: true 276.82/204.55 Simplify supporting invariants: trueOverapproximate stem: false 276.82/204.55 [2019-03-28 12:37:44,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.82/204.55 [2019-03-28 12:37:44,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.82/204.55 [2019-03-28 12:37:44,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.82/204.55 [2019-03-28 12:37:44,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.82/204.55 [2019-03-28 12:37:44,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.82/204.55 [2019-03-28 12:37:44,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.82/204.55 [2019-03-28 12:37:44,887 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 276.82/204.55 [2019-03-28 12:37:44,894 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 276.82/204.55 [2019-03-28 12:37:44,894 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. 276.82/204.55 [2019-03-28 12:37:44,894 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 276.82/204.55 [2019-03-28 12:37:44,895 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 276.82/204.55 [2019-03-28 12:37:44,895 INFO L518 LassoAnalysis]: Proved termination. 276.82/204.55 [2019-03-28 12:37:44,896 INFO L520 LassoAnalysis]: Termination argument consisting of: 276.82/204.55 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0.base) ULTIMATE.start_main_~tmp~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0.base) ULTIMATE.start_main_~tmp~0.offset)_2 276.82/204.55 Supporting invariants [] 276.82/204.55 [2019-03-28 12:37:44,975 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed 276.82/204.55 [2019-03-28 12:37:44,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 276.82/204.55 [2019-03-28 12:37:44,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.55 [2019-03-28 12:37:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:45,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core 276.82/204.55 [2019-03-28 12:37:45,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.82/204.55 [2019-03-28 12:37:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:45,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjunts are in the unsatisfiable core 276.82/204.55 [2019-03-28 12:37:45,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.82/204.55 [2019-03-28 12:37:45,050 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 276.82/204.55 [2019-03-28 12:37:45,051 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:45,056 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:45,057 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:45,057 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 276.82/204.55 [2019-03-28 12:37:45,141 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:45,142 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 61 276.82/204.55 [2019-03-28 12:37:45,147 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:45,173 INFO L497 ElimStorePlain]: treesize reduction 24, result has 48.9 percent of original size 276.82/204.55 [2019-03-28 12:37:45,174 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:45,174 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:23 276.82/204.55 [2019-03-28 12:37:45,337 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 276.82/204.55 [2019-03-28 12:37:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:45,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjunts are in the unsatisfiable core 276.82/204.55 [2019-03-28 12:37:45,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.82/204.55 [2019-03-28 12:37:45,757 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:45,757 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 59 276.82/204.55 [2019-03-28 12:37:45,760 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:45,781 INFO L497 ElimStorePlain]: treesize reduction 24, result has 51.0 percent of original size 276.82/204.55 [2019-03-28 12:37:45,781 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:45,781 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:25 276.82/204.55 [2019-03-28 12:37:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:46,244 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 276.82/204.55 [2019-03-28 12:37:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:46,257 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 276.82/204.55 [2019-03-28 12:37:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:46,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core 276.82/204.55 [2019-03-28 12:37:46,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.82/204.55 [2019-03-28 12:37:46,276 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 276.82/204.55 [2019-03-28 12:37:46,277 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:46,279 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:46,280 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:46,280 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:7 276.82/204.55 [2019-03-28 12:37:46,446 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:46,446 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 66 276.82/204.55 [2019-03-28 12:37:46,449 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:46,473 INFO L497 ElimStorePlain]: treesize reduction 26, result has 51.9 percent of original size 276.82/204.55 [2019-03-28 12:37:46,474 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:46,474 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:23 276.82/204.55 [2019-03-28 12:37:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:46,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core 276.82/204.55 [2019-03-28 12:37:46,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.82/204.55 [2019-03-28 12:37:46,875 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 276.82/204.55 [2019-03-28 12:37:46,876 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:46,878 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:46,878 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:46,878 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:7 276.82/204.55 [2019-03-28 12:37:46,901 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:46,901 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 66 276.82/204.55 [2019-03-28 12:37:46,903 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:46,927 INFO L497 ElimStorePlain]: treesize reduction 26, result has 51.9 percent of original size 276.82/204.55 [2019-03-28 12:37:46,927 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:46,928 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:23 276.82/204.55 [2019-03-28 12:37:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:46,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core 276.82/204.55 [2019-03-28 12:37:46,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.82/204.55 [2019-03-28 12:37:47,149 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:47,150 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 66 276.82/204.55 [2019-03-28 12:37:47,154 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:47,187 INFO L497 ElimStorePlain]: treesize reduction 37, result has 45.6 percent of original size 276.82/204.55 [2019-03-28 12:37:47,187 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:47,188 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:29 276.82/204.55 [2019-03-28 12:37:47,310 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:47,310 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 19 276.82/204.55 [2019-03-28 12:37:47,311 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:47,314 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 276.82/204.55 [2019-03-28 12:37:47,315 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:47,327 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:47,328 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:47,328 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:9 276.82/204.55 [2019-03-28 12:37:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:47,512 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 276.82/204.55 [2019-03-28 12:37:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.55 [2019-03-28 12:37:47,524 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 276.82/204.55 [2019-03-28 12:37:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:47,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjunts are in the unsatisfiable core 276.82/204.55 [2019-03-28 12:37:47,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.82/204.55 [2019-03-28 12:37:47,541 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 276.82/204.55 [2019-03-28 12:37:47,541 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:47,545 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:47,546 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:47,546 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 276.82/204.55 [2019-03-28 12:37:47,568 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:47,569 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 61 276.82/204.55 [2019-03-28 12:37:47,571 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:47,590 INFO L497 ElimStorePlain]: treesize reduction 24, result has 48.9 percent of original size 276.82/204.55 [2019-03-28 12:37:47,590 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:47,590 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:23 276.82/204.55 [2019-03-28 12:37:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.55 [2019-03-28 12:37:47,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjunts are in the unsatisfiable core 276.82/204.55 [2019-03-28 12:37:47,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.82/204.55 [2019-03-28 12:37:47,648 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 276.82/204.55 [2019-03-28 12:37:47,648 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:47,653 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.55 [2019-03-28 12:37:47,653 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.55 [2019-03-28 12:37:47,653 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 276.82/204.56 [2019-03-28 12:37:47,678 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.56 [2019-03-28 12:37:47,678 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 61 276.82/204.56 [2019-03-28 12:37:47,680 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.56 [2019-03-28 12:37:47,703 INFO L497 ElimStorePlain]: treesize reduction 24, result has 48.9 percent of original size 276.82/204.56 [2019-03-28 12:37:47,703 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.56 [2019-03-28 12:37:47,703 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:23 276.82/204.56 [2019-03-28 12:37:47,746 INFO L98 LoopCannibalizer]: 12 predicates before loop cannibalization 24 predicates after loop cannibalization 276.82/204.56 [2019-03-28 12:37:47,746 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 24 loop predicates 276.82/204.56 [2019-03-28 12:37:47,746 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 42 states and 57 transitions. cyclomatic complexity: 16 Second operand 11 states. 276.82/204.56 [2019-03-28 12:38:03,307 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 42 states and 57 transitions. cyclomatic complexity: 16. Second operand 11 states. Result 1840 states and 2341 transitions. Complement of second has 767 states. 276.82/204.56 [2019-03-28 12:38:03,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 56 states 1 stem states 52 non-accepting loop states 2 accepting loop states 276.82/204.56 [2019-03-28 12:38:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 276.82/204.56 [2019-03-28 12:38:03,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 175 transitions. 276.82/204.56 [2019-03-28 12:38:03,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 175 transitions. Stem has 19 letters. Loop has 15 letters. 276.82/204.56 [2019-03-28 12:38:03,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. 276.82/204.56 [2019-03-28 12:38:03,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 175 transitions. Stem has 34 letters. Loop has 15 letters. 276.82/204.56 [2019-03-28 12:38:03,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. 276.82/204.56 [2019-03-28 12:38:03,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 175 transitions. Stem has 19 letters. Loop has 30 letters. 276.82/204.56 [2019-03-28 12:38:03,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. 276.82/204.56 [2019-03-28 12:38:03,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1840 states and 2341 transitions. 276.82/204.56 [2019-03-28 12:38:03,334 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 59 276.82/204.56 [2019-03-28 12:38:03,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1840 states to 234 states and 289 transitions. 276.82/204.56 [2019-03-28 12:38:03,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 276.82/204.56 [2019-03-28 12:38:03,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 276.82/204.56 [2019-03-28 12:38:03,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 234 states and 289 transitions. 276.82/204.56 [2019-03-28 12:38:03,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 276.82/204.56 [2019-03-28 12:38:03,337 INFO L706 BuchiCegarLoop]: Abstraction has 234 states and 289 transitions. 276.82/204.56 [2019-03-28 12:38:03,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states and 289 transitions. 276.82/204.56 [2019-03-28 12:38:03,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 55. 276.82/204.56 [2019-03-28 12:38:03,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. 276.82/204.56 [2019-03-28 12:38:03,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. 276.82/204.56 [2019-03-28 12:38:03,341 INFO L729 BuchiCegarLoop]: Abstraction has 55 states and 74 transitions. 276.82/204.56 [2019-03-28 12:38:03,341 INFO L609 BuchiCegarLoop]: Abstraction has 55 states and 74 transitions. 276.82/204.56 [2019-03-28 12:38:03,341 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ 276.82/204.56 [2019-03-28 12:38:03,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 74 transitions. 276.82/204.56 [2019-03-28 12:38:03,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 276.82/204.56 [2019-03-28 12:38:03,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 276.82/204.56 [2019-03-28 12:38:03,342 INFO L119 BuchiIsEmpty]: Starting construction of run 276.82/204.56 [2019-03-28 12:38:03,343 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 276.82/204.56 [2019-03-28 12:38:03,343 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] 276.82/204.56 [2019-03-28 12:38:03,344 INFO L794 eck$LassoCheckResult]: Stem: 5169#ULTIMATE.startENTRY [121] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 5167#L-1 [186] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~id~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~maxId~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~id~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~maxId~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_1, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_1|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~maxId~0.base, ULTIMATE.start_main_~tmp~0.offset, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~tmp~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~id~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~maxId~0.offset, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~id~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 5162#L8 [255] L8-->L9: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_14) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19) v_ULTIMATE.start_main_~id~0.offset_14 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_20|) (<= (+ v_ULTIMATE.start_main_~id~0.offset_14 4) (select |v_#length_34| v_ULTIMATE.start_main_~id~0.base_19)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~id~0.base_19))) InVars {ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 5163#L9 [256] L9-->L11: Formula: (and (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~maxId~0.base_13)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_10) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_10 4) (select |v_#length_35| v_ULTIMATE.start_main_~maxId~0.base_13)) (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13) v_ULTIMATE.start_main_~maxId~0.offset_10 |v_ULTIMATE.start_main_#t~nondet3_5|)))) InVars {ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 5165#L11 [122] L11-->L11-1: Formula: (and (= (select |v_#valid_10| v_ULTIMATE.start_main_~id~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~id~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~id~0.base_7) v_ULTIMATE.start_main_~id~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~id~0.base_7))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #valid=|v_#valid_10|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 5168#L11-1 [200] L11-1-->L11-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 5166#L11-2 [100] L11-2-->L11-3: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 5164#L11-3 [97] L11-3-->L11-4: Formula: (and (= (select |v_#valid_12| v_ULTIMATE.start_main_~id~0.base_10) 1) (<= (+ v_ULTIMATE.start_main_~id~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~id~0.base_10)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~id~0.base_10) v_ULTIMATE.start_main_~id~0.offset_8))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #valid=|v_#valid_12|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 5159#L11-4 [91] L11-4-->L11-5: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~maxId~0.base_7) v_ULTIMATE.start_main_~maxId~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_6 4) (select |v_#length_12| v_ULTIMATE.start_main_~maxId~0.base_7)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_6) (= 1 (select |v_#valid_14| v_ULTIMATE.start_main_~maxId~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 5155#L11-5 [216] L11-5-->L11-7: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< |v_ULTIMATE.start_main_#t~mem5_3| |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 5156#L11-7 [206] L11-7-->L13: Formula: (and (= |v_#valid_16| (store |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1)) |v_ULTIMATE.start_main_#t~short7_7| (= 0 (select |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2|)) (= v_ULTIMATE.start_main_~tmp~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (= (store |v_#length_15| |v_ULTIMATE.start_main_#t~malloc8.base_2| 4) |v_#length_14|) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_2|) (> |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (= v_ULTIMATE.start_main_~tmp~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_15|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_7|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_2, #valid=|v_#valid_16|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #length=|v_#length_14|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_6|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_~tmp~0.base, ULTIMATE.start_main_~tmp~0.offset, #valid, ULTIMATE.start_main_#t~malloc8.offset, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4] 5176#L13 [146] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~id~0.offset_10 4) (select |v_#length_16| v_ULTIMATE.start_main_~id~0.base_13)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_10) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~id~0.base_13) v_ULTIMATE.start_main_~id~0.offset_10)) (= (select |v_#valid_18| v_ULTIMATE.start_main_~id~0.base_13) 1)) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #valid=|v_#valid_18|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 5172#L13-1 [259] L13-1-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_15) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_15 4) (select |v_#length_36| v_ULTIMATE.start_main_~tmp~0.base_21)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21) v_ULTIMATE.start_main_~tmp~0.offset_15 (+ |v_ULTIMATE.start_main_#t~mem9_6| 1))) |v_#memory_int_24|) (= (select |v_#valid_47| v_ULTIMATE.start_main_~tmp~0.base_21) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_36|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 5173#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 5183#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 5180#L14-2 [233] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 5181#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 5193#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 5192#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 5191#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 5145#L16-1 276.82/204.56 [2019-03-28 12:38:03,344 INFO L796 eck$LassoCheckResult]: Loop: 5145#L16-1 [260] L16-1-->L18-1: Formula: (and (= (select |v_#valid_48| v_ULTIMATE.start_main_~tmp~0.base_22) 1) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~tmp~0.base_22)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_16) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22) v_ULTIMATE.start_main_~tmp~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_26|)) InVars {ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 5146#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 5157#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 5170#L14-2 [232] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (> |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 5149#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 5150#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 5174#L15-2 [176] L15-2-->L18: Formula: (> |v_ULTIMATE.start_main_#t~mem13_6| |v_ULTIMATE.start_main_#t~mem14_6|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_6|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_5|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 5160#L18 [94] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_13) (= 1 (select |v_#valid_34| v_ULTIMATE.start_main_~tmp~0.base_18)) (= (store |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18 (store (select |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18) v_ULTIMATE.start_main_~tmp~0.offset_13 0)) |v_#memory_int_18|) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_main_~tmp~0.base_18))) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} OutVars{#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} AuxVars[] AssignedVars[#memory_int] 5161#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 5184#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 5182#L14-2 [232] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (> |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 5179#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 5178#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 5177#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 5153#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 5145#L16-1 276.82/204.56 [2019-03-28 12:38:03,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.56 [2019-03-28 12:38:03,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1159231161, now seen corresponding path program 1 times 276.82/204.56 [2019-03-28 12:38:03,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.56 [2019-03-28 12:38:03,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.56 [2019-03-28 12:38:03,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:03,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:03,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.56 [2019-03-28 12:38:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.56 [2019-03-28 12:38:03,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.56 [2019-03-28 12:38:03,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1451520445, now seen corresponding path program 1 times 276.82/204.56 [2019-03-28 12:38:03,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.56 [2019-03-28 12:38:03,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.56 [2019-03-28 12:38:03,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:03,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:03,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.56 [2019-03-28 12:38:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.56 [2019-03-28 12:38:03,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.56 [2019-03-28 12:38:03,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1685539835, now seen corresponding path program 1 times 276.82/204.56 [2019-03-28 12:38:03,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.56 [2019-03-28 12:38:03,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.56 [2019-03-28 12:38:03,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:03,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:03,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.56 [2019-03-28 12:38:03,508 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. 276.82/204.56 [2019-03-28 12:38:03,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 276.82/204.56 [2019-03-28 12:38:03,509 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 276.82/204.56 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 276.82/204.56 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 276.82/204.56 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 276.82/204.56 [2019-03-28 12:38:03,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.56 [2019-03-28 12:38:03,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 13 conjunts are in the unsatisfiable core 276.82/204.56 [2019-03-28 12:38:03,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.82/204.56 [2019-03-28 12:38:03,705 INFO L189 IndexEqualityManager]: detected not equals via solver 276.82/204.56 [2019-03-28 12:38:03,706 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 276.82/204.56 [2019-03-28 12:38:03,707 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.56 [2019-03-28 12:38:03,716 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.56 [2019-03-28 12:38:03,716 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.56 [2019-03-28 12:38:03,716 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:22 276.82/204.56 [2019-03-28 12:38:03,816 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. 276.82/204.56 [2019-03-28 12:38:03,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 276.82/204.56 [2019-03-28 12:38:03,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 276.82/204.56 [2019-03-28 12:38:04,043 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 276.82/204.56 [2019-03-28 12:38:04,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. 276.82/204.56 [2019-03-28 12:38:04,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 276.82/204.56 [2019-03-28 12:38:04,091 INFO L87 Difference]: Start difference. First operand 55 states and 74 transitions. cyclomatic complexity: 21 Second operand 19 states. 276.82/204.56 [2019-03-28 12:38:04,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 276.82/204.56 [2019-03-28 12:38:04,549 INFO L93 Difference]: Finished difference Result 168 states and 216 transitions. 276.82/204.56 [2019-03-28 12:38:04,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 276.82/204.56 [2019-03-28 12:38:04,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 216 transitions. 276.82/204.56 [2019-03-28 12:38:04,557 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 69 276.82/204.56 [2019-03-28 12:38:04,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 158 states and 204 transitions. 276.82/204.56 [2019-03-28 12:38:04,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 276.82/204.56 [2019-03-28 12:38:04,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 276.82/204.56 [2019-03-28 12:38:04,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 204 transitions. 276.82/204.56 [2019-03-28 12:38:04,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 276.82/204.56 [2019-03-28 12:38:04,559 INFO L706 BuchiCegarLoop]: Abstraction has 158 states and 204 transitions. 276.82/204.56 [2019-03-28 12:38:04,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 204 transitions. 276.82/204.56 [2019-03-28 12:38:04,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 81. 276.82/204.56 [2019-03-28 12:38:04,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. 276.82/204.56 [2019-03-28 12:38:04,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 105 transitions. 276.82/204.56 [2019-03-28 12:38:04,563 INFO L729 BuchiCegarLoop]: Abstraction has 81 states and 105 transitions. 276.82/204.56 [2019-03-28 12:38:04,563 INFO L609 BuchiCegarLoop]: Abstraction has 81 states and 105 transitions. 276.82/204.56 [2019-03-28 12:38:04,563 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ 276.82/204.56 [2019-03-28 12:38:04,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 105 transitions. 276.82/204.56 [2019-03-28 12:38:04,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 276.82/204.56 [2019-03-28 12:38:04,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 276.82/204.56 [2019-03-28 12:38:04,564 INFO L119 BuchiIsEmpty]: Starting construction of run 276.82/204.56 [2019-03-28 12:38:04,565 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 276.82/204.56 [2019-03-28 12:38:04,565 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] 276.82/204.56 [2019-03-28 12:38:04,566 INFO L794 eck$LassoCheckResult]: Stem: 5530#ULTIMATE.startENTRY [121] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 5527#L-1 [186] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~id~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~maxId~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~id~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~maxId~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_1, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_1|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~maxId~0.base, ULTIMATE.start_main_~tmp~0.offset, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~tmp~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~id~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~maxId~0.offset, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~id~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 5521#L8 [255] L8-->L9: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_14) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19) v_ULTIMATE.start_main_~id~0.offset_14 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_20|) (<= (+ v_ULTIMATE.start_main_~id~0.offset_14 4) (select |v_#length_34| v_ULTIMATE.start_main_~id~0.base_19)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~id~0.base_19))) InVars {ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 5522#L9 [256] L9-->L11: Formula: (and (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~maxId~0.base_13)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_10) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_10 4) (select |v_#length_35| v_ULTIMATE.start_main_~maxId~0.base_13)) (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13) v_ULTIMATE.start_main_~maxId~0.offset_10 |v_ULTIMATE.start_main_#t~nondet3_5|)))) InVars {ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 5525#L11 [122] L11-->L11-1: Formula: (and (= (select |v_#valid_10| v_ULTIMATE.start_main_~id~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~id~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~id~0.base_7) v_ULTIMATE.start_main_~id~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~id~0.base_7))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #valid=|v_#valid_10|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 5529#L11-1 [200] L11-1-->L11-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 5526#L11-2 [100] L11-2-->L11-3: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 5523#L11-3 [97] L11-3-->L11-4: Formula: (and (= (select |v_#valid_12| v_ULTIMATE.start_main_~id~0.base_10) 1) (<= (+ v_ULTIMATE.start_main_~id~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~id~0.base_10)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~id~0.base_10) v_ULTIMATE.start_main_~id~0.offset_8))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #valid=|v_#valid_12|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 5524#L11-4 [91] L11-4-->L11-5: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~maxId~0.base_7) v_ULTIMATE.start_main_~maxId~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_6 4) (select |v_#length_12| v_ULTIMATE.start_main_~maxId~0.base_7)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_6) (= 1 (select |v_#valid_14| v_ULTIMATE.start_main_~maxId~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 5512#L11-5 [216] L11-5-->L11-7: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< |v_ULTIMATE.start_main_#t~mem5_3| |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 5513#L11-7 [205] L11-7-->L13: Formula: (and (= |v_#valid_16| (store |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1)) |v_ULTIMATE.start_main_#t~short7_7| (= 0 (select |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2|)) (= v_ULTIMATE.start_main_~tmp~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (= (store |v_#length_15| |v_ULTIMATE.start_main_#t~malloc8.base_2| 4) |v_#length_14|) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_2|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (= v_ULTIMATE.start_main_~tmp~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_15|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_7|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_2, #valid=|v_#valid_16|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #length=|v_#length_14|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_6|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_~tmp~0.base, ULTIMATE.start_main_~tmp~0.offset, #valid, ULTIMATE.start_main_#t~malloc8.offset, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4] 5540#L13 [146] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~id~0.offset_10 4) (select |v_#length_16| v_ULTIMATE.start_main_~id~0.base_13)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_10) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~id~0.base_13) v_ULTIMATE.start_main_~id~0.offset_10)) (= (select |v_#valid_18| v_ULTIMATE.start_main_~id~0.base_13) 1)) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #valid=|v_#valid_18|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 5533#L13-1 [259] L13-1-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_15) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_15 4) (select |v_#length_36| v_ULTIMATE.start_main_~tmp~0.base_21)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21) v_ULTIMATE.start_main_~tmp~0.offset_15 (+ |v_ULTIMATE.start_main_#t~mem9_6| 1))) |v_#memory_int_24|) (= (select |v_#valid_47| v_ULTIMATE.start_main_~tmp~0.base_21) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_36|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 5534#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 5551#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 5549#L14-2 [233] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 5548#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 5546#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 5536#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 5537#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 5502#L16-1 276.82/204.56 [2019-03-28 12:38:04,567 INFO L796 eck$LassoCheckResult]: Loop: 5502#L16-1 [260] L16-1-->L18-1: Formula: (and (= (select |v_#valid_48| v_ULTIMATE.start_main_~tmp~0.base_22) 1) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~tmp~0.base_22)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_16) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22) v_ULTIMATE.start_main_~tmp~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_26|)) InVars {ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 5503#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 5514#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 5531#L14-2 [232] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (> |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 5506#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 5507#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 5541#L15-2 [176] L15-2-->L18: Formula: (> |v_ULTIMATE.start_main_#t~mem13_6| |v_ULTIMATE.start_main_#t~mem14_6|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_6|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_5|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 5519#L18 [94] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_13) (= 1 (select |v_#valid_34| v_ULTIMATE.start_main_~tmp~0.base_18)) (= (store |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18 (store (select |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18) v_ULTIMATE.start_main_~tmp~0.offset_13 0)) |v_#memory_int_18|) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_main_~tmp~0.base_18))) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} OutVars{#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} AuxVars[] AssignedVars[#memory_int] 5520#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 5579#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 5578#L14-2 [232] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (> |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 5577#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 5576#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 5575#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 5510#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 5502#L16-1 276.82/204.56 [2019-03-28 12:38:04,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.56 [2019-03-28 12:38:04,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1355744666, now seen corresponding path program 1 times 276.82/204.56 [2019-03-28 12:38:04,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.56 [2019-03-28 12:38:04,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.56 [2019-03-28 12:38:04,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:04,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:04,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.56 [2019-03-28 12:38:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.56 [2019-03-28 12:38:04,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.56 [2019-03-28 12:38:04,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1451520445, now seen corresponding path program 2 times 276.82/204.56 [2019-03-28 12:38:04,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.56 [2019-03-28 12:38:04,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.56 [2019-03-28 12:38:04,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:04,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:04,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.56 [2019-03-28 12:38:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.56 [2019-03-28 12:38:04,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.56 [2019-03-28 12:38:04,605 INFO L82 PathProgramCache]: Analyzing trace with hash 391669508, now seen corresponding path program 1 times 276.82/204.56 [2019-03-28 12:38:04,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.56 [2019-03-28 12:38:04,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.56 [2019-03-28 12:38:04,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:04,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:04,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.56 [2019-03-28 12:38:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 276.82/204.56 [2019-03-28 12:38:04,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 276.82/204.56 [2019-03-28 12:38:04,931 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 276.82/204.56 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 276.82/204.56 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 276.82/204.56 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 276.82/204.56 [2019-03-28 12:38:04,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.56 [2019-03-28 12:38:04,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 18 conjunts are in the unsatisfiable core 276.82/204.56 [2019-03-28 12:38:04,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.82/204.56 [2019-03-28 12:38:04,984 INFO L340 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size 276.82/204.56 [2019-03-28 12:38:04,985 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 276.82/204.56 [2019-03-28 12:38:04,985 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.56 [2019-03-28 12:38:04,990 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.56 [2019-03-28 12:38:04,991 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 276.82/204.56 [2019-03-28 12:38:04,991 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 276.82/204.56 [2019-03-28 12:38:05,030 INFO L189 IndexEqualityManager]: detected not equals via solver 276.82/204.56 [2019-03-28 12:38:05,041 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.56 [2019-03-28 12:38:05,041 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 276.82/204.56 [2019-03-28 12:38:05,042 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.56 [2019-03-28 12:38:05,048 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.56 [2019-03-28 12:38:05,048 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 276.82/204.56 [2019-03-28 12:38:05,048 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:8 276.82/204.56 [2019-03-28 12:38:05,211 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 276.82/204.56 [2019-03-28 12:38:05,211 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.56 [2019-03-28 12:38:05,219 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.56 [2019-03-28 12:38:05,220 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.56 [2019-03-28 12:38:05,220 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:21 276.82/204.56 [2019-03-28 12:38:05,356 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. 276.82/204.56 [2019-03-28 12:38:05,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 276.82/204.56 [2019-03-28 12:38:05,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11] total 29 276.82/204.56 [2019-03-28 12:38:05,584 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 276.82/204.56 [2019-03-28 12:38:05,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. 276.82/204.56 [2019-03-28 12:38:05,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 276.82/204.56 [2019-03-28 12:38:05,632 INFO L87 Difference]: Start difference. First operand 81 states and 105 transitions. cyclomatic complexity: 27 Second operand 29 states. 276.82/204.56 [2019-03-28 12:38:07,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 276.82/204.56 [2019-03-28 12:38:07,927 INFO L93 Difference]: Finished difference Result 323 states and 407 transitions. 276.82/204.56 [2019-03-28 12:38:07,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. 276.82/204.56 [2019-03-28 12:38:07,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 323 states and 407 transitions. 276.82/204.56 [2019-03-28 12:38:07,936 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 92 276.82/204.56 [2019-03-28 12:38:07,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 323 states to 254 states and 323 transitions. 276.82/204.56 [2019-03-28 12:38:07,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 276.82/204.56 [2019-03-28 12:38:07,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173 276.82/204.56 [2019-03-28 12:38:07,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 254 states and 323 transitions. 276.82/204.56 [2019-03-28 12:38:07,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 276.82/204.56 [2019-03-28 12:38:07,939 INFO L706 BuchiCegarLoop]: Abstraction has 254 states and 323 transitions. 276.82/204.56 [2019-03-28 12:38:07,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states and 323 transitions. 276.82/204.56 [2019-03-28 12:38:07,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 99. 276.82/204.56 [2019-03-28 12:38:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. 276.82/204.56 [2019-03-28 12:38:07,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. 276.82/204.56 [2019-03-28 12:38:07,943 INFO L729 BuchiCegarLoop]: Abstraction has 99 states and 123 transitions. 276.82/204.56 [2019-03-28 12:38:07,943 INFO L609 BuchiCegarLoop]: Abstraction has 99 states and 123 transitions. 276.82/204.56 [2019-03-28 12:38:07,943 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ 276.82/204.56 [2019-03-28 12:38:07,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 123 transitions. 276.82/204.56 [2019-03-28 12:38:07,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 276.82/204.56 [2019-03-28 12:38:07,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 276.82/204.56 [2019-03-28 12:38:07,944 INFO L119 BuchiIsEmpty]: Starting construction of run 276.82/204.56 [2019-03-28 12:38:07,945 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 276.82/204.56 [2019-03-28 12:38:07,945 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] 276.82/204.56 [2019-03-28 12:38:07,946 INFO L794 eck$LassoCheckResult]: Stem: 6142#ULTIMATE.startENTRY [121] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 6136#L-1 [183] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~id~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~maxId~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~id~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~maxId~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_1, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_1|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~maxId~0.base, ULTIMATE.start_main_~tmp~0.offset, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~tmp~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~id~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~maxId~0.offset, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~id~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 6137#L8 [255] L8-->L9: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_14) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19) v_ULTIMATE.start_main_~id~0.offset_14 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_20|) (<= (+ v_ULTIMATE.start_main_~id~0.offset_14 4) (select |v_#length_34| v_ULTIMATE.start_main_~id~0.base_19)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~id~0.base_19))) InVars {ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 6170#L9 [256] L9-->L11: Formula: (and (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~maxId~0.base_13)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_10) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_10 4) (select |v_#length_35| v_ULTIMATE.start_main_~maxId~0.base_13)) (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13) v_ULTIMATE.start_main_~maxId~0.offset_10 |v_ULTIMATE.start_main_#t~nondet3_5|)))) InVars {ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 6168#L11 [122] L11-->L11-1: Formula: (and (= (select |v_#valid_10| v_ULTIMATE.start_main_~id~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~id~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~id~0.base_7) v_ULTIMATE.start_main_~id~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~id~0.base_7))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #valid=|v_#valid_10|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 6169#L11-1 [200] L11-1-->L11-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 6166#L11-2 [100] L11-2-->L11-3: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 6167#L11-3 [97] L11-3-->L11-4: Formula: (and (= (select |v_#valid_12| v_ULTIMATE.start_main_~id~0.base_10) 1) (<= (+ v_ULTIMATE.start_main_~id~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~id~0.base_10)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~id~0.base_10) v_ULTIMATE.start_main_~id~0.offset_8))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #valid=|v_#valid_12|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 6164#L11-4 [91] L11-4-->L11-5: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~maxId~0.base_7) v_ULTIMATE.start_main_~maxId~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_6 4) (select |v_#length_12| v_ULTIMATE.start_main_~maxId~0.base_7)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_6) (= 1 (select |v_#valid_14| v_ULTIMATE.start_main_~maxId~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 6165#L11-5 [216] L11-5-->L11-7: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< |v_ULTIMATE.start_main_#t~mem5_3| |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 6161#L11-7 [205] L11-7-->L13: Formula: (and (= |v_#valid_16| (store |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1)) |v_ULTIMATE.start_main_#t~short7_7| (= 0 (select |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2|)) (= v_ULTIMATE.start_main_~tmp~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (= (store |v_#length_15| |v_ULTIMATE.start_main_#t~malloc8.base_2| 4) |v_#length_14|) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_2|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (= v_ULTIMATE.start_main_~tmp~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_15|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_7|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_2, #valid=|v_#valid_16|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #length=|v_#length_14|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_6|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_~tmp~0.base, ULTIMATE.start_main_~tmp~0.offset, #valid, ULTIMATE.start_main_#t~malloc8.offset, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4] 6159#L13 [146] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~id~0.offset_10 4) (select |v_#length_16| v_ULTIMATE.start_main_~id~0.base_13)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_10) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~id~0.base_13) v_ULTIMATE.start_main_~id~0.offset_10)) (= (select |v_#valid_18| v_ULTIMATE.start_main_~id~0.base_13) 1)) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #valid=|v_#valid_18|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 6145#L13-1 [259] L13-1-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_15) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_15 4) (select |v_#length_36| v_ULTIMATE.start_main_~tmp~0.base_21)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21) v_ULTIMATE.start_main_~tmp~0.offset_15 (+ |v_ULTIMATE.start_main_#t~mem9_6| 1))) |v_#memory_int_24|) (= (select |v_#valid_47| v_ULTIMATE.start_main_~tmp~0.base_21) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_36|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 6146#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 6201#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 6147#L14-2 [233] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 6108#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 6109#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 6152#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 6153#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 6112#L16-1 276.82/204.56 [2019-03-28 12:38:07,947 INFO L796 eck$LassoCheckResult]: Loop: 6112#L16-1 [260] L16-1-->L18-1: Formula: (and (= (select |v_#valid_48| v_ULTIMATE.start_main_~tmp~0.base_22) 1) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~tmp~0.base_22)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_16) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22) v_ULTIMATE.start_main_~tmp~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_26|)) InVars {ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 6113#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 6122#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 6151#L14-2 [232] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (> |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 6172#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 6171#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 6160#L15-2 [176] L15-2-->L18: Formula: (> |v_ULTIMATE.start_main_#t~mem13_6| |v_ULTIMATE.start_main_#t~mem14_6|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_6|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_5|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 6126#L18 [94] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_13) (= 1 (select |v_#valid_34| v_ULTIMATE.start_main_~tmp~0.base_18)) (= (store |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18 (store (select |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18) v_ULTIMATE.start_main_~tmp~0.offset_13 0)) |v_#memory_int_18|) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_main_~tmp~0.base_18))) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} OutVars{#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} AuxVars[] AssignedVars[#memory_int] 6127#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 6206#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 6205#L14-2 [232] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (> |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 6204#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 6203#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 6202#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 6176#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 6112#L16-1 276.82/204.56 [2019-03-28 12:38:07,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.56 [2019-03-28 12:38:07,947 INFO L82 PathProgramCache]: Analyzing trace with hash -405807017, now seen corresponding path program 1 times 276.82/204.56 [2019-03-28 12:38:07,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.56 [2019-03-28 12:38:07,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.56 [2019-03-28 12:38:07,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:07,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:07,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.56 [2019-03-28 12:38:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.56 [2019-03-28 12:38:07,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.56 [2019-03-28 12:38:07,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1451520445, now seen corresponding path program 3 times 276.82/204.56 [2019-03-28 12:38:07,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.56 [2019-03-28 12:38:07,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.56 [2019-03-28 12:38:07,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:07,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:07,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.56 [2019-03-28 12:38:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.82/204.56 [2019-03-28 12:38:07,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.82/204.56 [2019-03-28 12:38:07,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1610160807, now seen corresponding path program 1 times 276.82/204.56 [2019-03-28 12:38:07,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.82/204.56 [2019-03-28 12:38:07,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.82/204.56 [2019-03-28 12:38:07,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:07,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:07,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.56 [2019-03-28 12:38:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. 276.82/204.56 [2019-03-28 12:38:08,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 276.82/204.56 [2019-03-28 12:38:08,103 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 276.82/204.56 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 276.82/204.56 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 276.82/204.56 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 276.82/204.56 [2019-03-28 12:38:08,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.82/204.56 [2019-03-28 12:38:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.82/204.56 [2019-03-28 12:38:08,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 15 conjunts are in the unsatisfiable core 276.82/204.56 [2019-03-28 12:38:08,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.82/204.56 [2019-03-28 12:38:08,176 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.56 [2019-03-28 12:38:08,177 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 276.82/204.56 [2019-03-28 12:38:08,177 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.56 [2019-03-28 12:38:08,179 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.56 [2019-03-28 12:38:08,179 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 276.82/204.56 [2019-03-28 12:38:08,180 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 276.82/204.56 [2019-03-28 12:38:08,231 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 276.82/204.56 [2019-03-28 12:38:08,231 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.82/204.56 [2019-03-28 12:38:08,239 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.82/204.56 [2019-03-28 12:38:08,240 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.82/204.56 [2019-03-28 12:38:08,240 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:18 276.92/204.56 [2019-03-28 12:38:08,320 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. 276.92/204.56 [2019-03-28 12:38:08,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 276.92/204.56 [2019-03-28 12:38:08,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 276.92/204.56 [2019-03-28 12:38:08,559 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 276.92/204.56 [2019-03-28 12:38:08,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. 276.92/204.56 [2019-03-28 12:38:08,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 276.92/204.56 [2019-03-28 12:38:08,608 INFO L87 Difference]: Start difference. First operand 99 states and 123 transitions. cyclomatic complexity: 27 Second operand 16 states. 276.92/204.56 [2019-03-28 12:38:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 276.92/204.56 [2019-03-28 12:38:08,918 INFO L93 Difference]: Finished difference Result 116 states and 138 transitions. 276.92/204.56 [2019-03-28 12:38:08,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 276.92/204.56 [2019-03-28 12:38:08,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 138 transitions. 276.92/204.56 [2019-03-28 12:38:08,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 276.92/204.56 [2019-03-28 12:38:08,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 106 states and 126 transitions. 276.92/204.56 [2019-03-28 12:38:08,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 276.92/204.56 [2019-03-28 12:38:08,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 276.92/204.56 [2019-03-28 12:38:08,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 126 transitions. 276.92/204.56 [2019-03-28 12:38:08,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 276.92/204.56 [2019-03-28 12:38:08,939 INFO L706 BuchiCegarLoop]: Abstraction has 106 states and 126 transitions. 276.92/204.56 [2019-03-28 12:38:08,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 126 transitions. 276.92/204.56 [2019-03-28 12:38:08,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 64. 276.92/204.56 [2019-03-28 12:38:08,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. 276.92/204.56 [2019-03-28 12:38:08,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. 276.92/204.56 [2019-03-28 12:38:08,942 INFO L729 BuchiCegarLoop]: Abstraction has 64 states and 79 transitions. 276.92/204.56 [2019-03-28 12:38:08,942 INFO L609 BuchiCegarLoop]: Abstraction has 64 states and 79 transitions. 276.92/204.56 [2019-03-28 12:38:08,942 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ 276.92/204.56 [2019-03-28 12:38:08,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 79 transitions. 276.92/204.56 [2019-03-28 12:38:08,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 276.92/204.56 [2019-03-28 12:38:08,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 276.92/204.56 [2019-03-28 12:38:08,943 INFO L119 BuchiIsEmpty]: Starting construction of run 276.92/204.56 [2019-03-28 12:38:08,944 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 276.92/204.56 [2019-03-28 12:38:08,944 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] 276.92/204.56 [2019-03-28 12:38:08,945 INFO L794 eck$LassoCheckResult]: Stem: 6491#ULTIMATE.startENTRY [121] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 6488#L-1 [185] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~id~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~maxId~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~id~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_main_~maxId~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_1, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_1|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~maxId~0.base, ULTIMATE.start_main_~tmp~0.offset, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~tmp~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~id~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~maxId~0.offset, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~id~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 6489#L8 [255] L8-->L9: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_14) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19) v_ULTIMATE.start_main_~id~0.offset_14 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_20|) (<= (+ v_ULTIMATE.start_main_~id~0.offset_14 4) (select |v_#length_34| v_ULTIMATE.start_main_~id~0.base_19)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~id~0.base_19))) InVars {ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 6508#L9 [256] L9-->L11: Formula: (and (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~maxId~0.base_13)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_10) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_10 4) (select |v_#length_35| v_ULTIMATE.start_main_~maxId~0.base_13)) (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13) v_ULTIMATE.start_main_~maxId~0.offset_10 |v_ULTIMATE.start_main_#t~nondet3_5|)))) InVars {ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 6507#L11 [122] L11-->L11-1: Formula: (and (= (select |v_#valid_10| v_ULTIMATE.start_main_~id~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~id~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~id~0.base_7) v_ULTIMATE.start_main_~id~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~id~0.base_7))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #valid=|v_#valid_10|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 6506#L11-1 [200] L11-1-->L11-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 6505#L11-2 [100] L11-2-->L11-3: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 6504#L11-3 [97] L11-3-->L11-4: Formula: (and (= (select |v_#valid_12| v_ULTIMATE.start_main_~id~0.base_10) 1) (<= (+ v_ULTIMATE.start_main_~id~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~id~0.base_10)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~id~0.base_10) v_ULTIMATE.start_main_~id~0.offset_8))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #valid=|v_#valid_12|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 6503#L11-4 [91] L11-4-->L11-5: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~maxId~0.base_7) v_ULTIMATE.start_main_~maxId~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_6 4) (select |v_#length_12| v_ULTIMATE.start_main_~maxId~0.base_7)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_6) (= 1 (select |v_#valid_14| v_ULTIMATE.start_main_~maxId~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 6502#L11-5 [216] L11-5-->L11-7: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< |v_ULTIMATE.start_main_#t~mem5_3| |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 6501#L11-7 [206] L11-7-->L13: Formula: (and (= |v_#valid_16| (store |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1)) |v_ULTIMATE.start_main_#t~short7_7| (= 0 (select |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2|)) (= v_ULTIMATE.start_main_~tmp~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (= (store |v_#length_15| |v_ULTIMATE.start_main_#t~malloc8.base_2| 4) |v_#length_14|) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_2|) (> |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (= v_ULTIMATE.start_main_~tmp~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_15|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_7|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_2, #valid=|v_#valid_16|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #length=|v_#length_14|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_6|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_~tmp~0.base, ULTIMATE.start_main_~tmp~0.offset, #valid, ULTIMATE.start_main_#t~malloc8.offset, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4] 6499#L13 [146] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~id~0.offset_10 4) (select |v_#length_16| v_ULTIMATE.start_main_~id~0.base_13)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_10) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~id~0.base_13) v_ULTIMATE.start_main_~id~0.offset_10)) (= (select |v_#valid_18| v_ULTIMATE.start_main_~id~0.base_13) 1)) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #valid=|v_#valid_18|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 6495#L13-1 [259] L13-1-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_15) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_15 4) (select |v_#length_36| v_ULTIMATE.start_main_~tmp~0.base_21)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21) v_ULTIMATE.start_main_~tmp~0.offset_15 (+ |v_ULTIMATE.start_main_#t~mem9_6| 1))) |v_#memory_int_24|) (= (select |v_#valid_47| v_ULTIMATE.start_main_~tmp~0.base_21) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_36|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 6496#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 6512#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 6511#L14-2 [233] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 6510#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 6509#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 6497#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 6472#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 6474#L16-1 [260] L16-1-->L18-1: Formula: (and (= (select |v_#valid_48| v_ULTIMATE.start_main_~tmp~0.base_22) 1) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~tmp~0.base_22)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_16) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22) v_ULTIMATE.start_main_~tmp~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_26|)) InVars {ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 6518#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 6517#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 6516#L14-2 [233] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 6468#L15 276.92/204.56 [2019-03-28 12:38:08,945 INFO L796 eck$LassoCheckResult]: Loop: 6468#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 6469#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 6500#L15-2 [176] L15-2-->L18: Formula: (> |v_ULTIMATE.start_main_#t~mem13_6| |v_ULTIMATE.start_main_#t~mem14_6|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_6|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_5|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 6481#L18 [94] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_13) (= 1 (select |v_#valid_34| v_ULTIMATE.start_main_~tmp~0.base_18)) (= (store |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18 (store (select |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18) v_ULTIMATE.start_main_~tmp~0.offset_13 0)) |v_#memory_int_18|) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_main_~tmp~0.base_18))) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} OutVars{#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} AuxVars[] AssignedVars[#memory_int] 6482#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 6527#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 6526#L14-2 [232] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (> |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 6525#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 6524#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 6523#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 6519#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 6464#L16-1 [260] L16-1-->L18-1: Formula: (and (= (select |v_#valid_48| v_ULTIMATE.start_main_~tmp~0.base_22) 1) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~tmp~0.base_22)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_16) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22) v_ULTIMATE.start_main_~tmp~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_26|)) InVars {ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 6465#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 6478#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 6492#L14-2 [232] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (> |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 6468#L15 276.92/204.56 [2019-03-28 12:38:08,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.92/204.56 [2019-03-28 12:38:08,946 INFO L82 PathProgramCache]: Analyzing trace with hash 945971626, now seen corresponding path program 1 times 276.92/204.56 [2019-03-28 12:38:08,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.92/204.56 [2019-03-28 12:38:08,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.92/204.56 [2019-03-28 12:38:08,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:08,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:08,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.56 [2019-03-28 12:38:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.56 [2019-03-28 12:38:08,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.92/204.56 [2019-03-28 12:38:08,971 INFO L82 PathProgramCache]: Analyzing trace with hash 458292287, now seen corresponding path program 4 times 276.92/204.56 [2019-03-28 12:38:08,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.92/204.56 [2019-03-28 12:38:08,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.92/204.56 [2019-03-28 12:38:08,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:08,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:08,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.56 [2019-03-28 12:38:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.56 [2019-03-28 12:38:08,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.92/204.56 [2019-03-28 12:38:08,984 INFO L82 PathProgramCache]: Analyzing trace with hash 17560438, now seen corresponding path program 1 times 276.92/204.56 [2019-03-28 12:38:08,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.92/204.56 [2019-03-28 12:38:08,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.92/204.56 [2019-03-28 12:38:08,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:08,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:08,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.56 [2019-03-28 12:38:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.56 [2019-03-28 12:38:09,210 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 276.92/204.56 [2019-03-28 12:38:09,938 WARN L188 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 134 276.92/204.56 [2019-03-28 12:38:10,069 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 80 276.92/204.56 [2019-03-28 12:38:10,072 INFO L216 LassoAnalysis]: Preferences: 276.92/204.56 [2019-03-28 12:38:10,072 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 276.92/204.56 [2019-03-28 12:38:10,072 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 276.92/204.56 [2019-03-28 12:38:10,072 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 276.92/204.56 [2019-03-28 12:38:10,073 INFO L127 ssoRankerPreferences]: Use exernal solver: false 276.92/204.56 [2019-03-28 12:38:10,073 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 276.92/204.56 [2019-03-28 12:38:10,073 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 276.92/204.56 [2019-03-28 12:38:10,073 INFO L130 ssoRankerPreferences]: Path of dumped script: 276.92/204.56 [2019-03-28 12:38:10,073 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration13_Lasso 276.92/204.56 [2019-03-28 12:38:10,073 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 276.92/204.56 [2019-03-28 12:38:10,073 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 276.92/204.56 [2019-03-28 12:38:10,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:10,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:10,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:10,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:10,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:10,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:10,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:10,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:10,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:10,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:10,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:10,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:10,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:10,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:10,395 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 276.92/204.56 [2019-03-28 12:38:10,505 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 276.92/204.56 [2019-03-28 12:38:10,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:10,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:10,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:10,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:10,909 INFO L300 LassoAnalysis]: Preprocessing complete. 276.92/204.56 [2019-03-28 12:38:10,909 INFO L497 LassoAnalysis]: Using template 'affine'. 276.92/204.56 [2019-03-28 12:38:10,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:10,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:10,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.56 [2019-03-28 12:38:10,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:10,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:10,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:10,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:10,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:10,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:10,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:10,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:10,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:10,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:10,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:10,914 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:10,914 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:10,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:10,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:10,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:10,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.56 [2019-03-28 12:38:10,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:10,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:10,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:10,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:10,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:10,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:10,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:10,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:10,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:10,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:10,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:10,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:10,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:10,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:10,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:10,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:10,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.56 [2019-03-28 12:38:10,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:10,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:10,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:10,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:10,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:10,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:10,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:10,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:10,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.56 [2019-03-28 12:38:10,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:10,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:10,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:10,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:10,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:10,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:10,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:10,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:10,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.56 [2019-03-28 12:38:10,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:10,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:10,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:10,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:10,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:10,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:10,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:10,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:10,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.56 [2019-03-28 12:38:10,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:10,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:10,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:10,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:10,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:10,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:10,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:10,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:10,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.56 [2019-03-28 12:38:10,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:10,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:10,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:10,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:10,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:10,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:10,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:10,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:10,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:10,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:10,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:10,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:10,933 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:10,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:10,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:10,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:10,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.56 [2019-03-28 12:38:10,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:10,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:10,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:10,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:10,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:10,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:10,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:10,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:10,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.56 [2019-03-28 12:38:10,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:10,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:10,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:10,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:10,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:10,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:10,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:10,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:10,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.56 [2019-03-28 12:38:10,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:10,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:10,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:10,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:10,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:10,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:10,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:10,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:10,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:10,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:10,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:10,942 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:10,942 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:10,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:10,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:10,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:10,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:10,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:10,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:10,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:10,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:10,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:10,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:10,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:10,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:10,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:10,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:10,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:10,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:10,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:10,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:10,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:10,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:10,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:10,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:10,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:10,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:10,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:10,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:10,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:10,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:10,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:10,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:10,965 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:10,965 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:10,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:10,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:10,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:10,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:10,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:10,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:10,978 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:10,978 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:10,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:10,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:10,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:10,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:10,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:10,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:10,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:10,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:11,000 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 276.92/204.56 [2019-03-28 12:38:11,009 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 276.92/204.56 [2019-03-28 12:38:11,010 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. 276.92/204.56 [2019-03-28 12:38:11,010 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 276.92/204.56 [2019-03-28 12:38:11,011 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 276.92/204.56 [2019-03-28 12:38:11,011 INFO L518 LassoAnalysis]: Proved termination. 276.92/204.56 [2019-03-28 12:38:11,012 INFO L520 LassoAnalysis]: Termination argument consisting of: 276.92/204.56 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0.base) ULTIMATE.start_main_~tmp~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0.base) ULTIMATE.start_main_~tmp~0.offset)_3 276.92/204.56 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0.base) ULTIMATE.start_main_~maxId~0.offset)_3 - 1 >= 0] 276.92/204.56 [2019-03-28 12:38:11,099 INFO L297 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed 276.92/204.56 [2019-03-28 12:38:11,102 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 276.92/204.56 [2019-03-28 12:38:11,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.92/204.56 [2019-03-28 12:38:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.56 [2019-03-28 12:38:11,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 14 conjunts are in the unsatisfiable core 276.92/204.56 [2019-03-28 12:38:11,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.56 [2019-03-28 12:38:11,260 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:11,261 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 49 276.92/204.56 [2019-03-28 12:38:11,262 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:11,299 INFO L497 ElimStorePlain]: treesize reduction 18, result has 71.4 percent of original size 276.92/204.56 [2019-03-28 12:38:11,300 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:11,301 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:39 276.92/204.56 [2019-03-28 12:38:11,433 INFO L189 IndexEqualityManager]: detected not equals via solver 276.92/204.56 [2019-03-28 12:38:11,434 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 276.92/204.56 [2019-03-28 12:38:11,434 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:11,445 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:11,446 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:11,446 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:14 276.92/204.56 [2019-03-28 12:38:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.56 [2019-03-28 12:38:11,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core 276.92/204.56 [2019-03-28 12:38:11,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.56 [2019-03-28 12:38:11,608 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:11,609 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 62 276.92/204.56 [2019-03-28 12:38:11,612 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:11,636 INFO L497 ElimStorePlain]: treesize reduction 43, result has 36.8 percent of original size 276.92/204.56 [2019-03-28 12:38:11,637 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:11,637 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 276.92/204.56 [2019-03-28 12:38:11,717 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:11,718 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 69 276.92/204.56 [2019-03-28 12:38:11,720 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:11,762 INFO L497 ElimStorePlain]: treesize reduction 45, result has 45.8 percent of original size 276.92/204.56 [2019-03-28 12:38:11,763 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:11,763 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:32 276.92/204.56 [2019-03-28 12:38:11,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 276.92/204.56 [2019-03-28 12:38:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.56 [2019-03-28 12:38:12,411 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 276.92/204.56 [2019-03-28 12:38:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.56 [2019-03-28 12:38:12,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core 276.92/204.56 [2019-03-28 12:38:12,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.56 [2019-03-28 12:38:12,499 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:12,499 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 64 276.92/204.56 [2019-03-28 12:38:12,503 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:12,576 INFO L497 ElimStorePlain]: treesize reduction 47, result has 48.9 percent of original size 276.92/204.56 [2019-03-28 12:38:12,577 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 276.92/204.56 [2019-03-28 12:38:12,577 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:45 276.92/204.56 [2019-03-28 12:38:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.56 [2019-03-28 12:38:13,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core 276.92/204.56 [2019-03-28 12:38:13,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.56 [2019-03-28 12:38:13,157 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:13,158 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 64 276.92/204.56 [2019-03-28 12:38:13,161 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:13,213 INFO L497 ElimStorePlain]: treesize reduction 48, result has 47.3 percent of original size 276.92/204.56 [2019-03-28 12:38:13,214 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 276.92/204.56 [2019-03-28 12:38:13,214 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:45 276.92/204.56 [2019-03-28 12:38:13,361 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:13,361 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 64 276.92/204.56 [2019-03-28 12:38:13,365 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:13,394 INFO L497 ElimStorePlain]: treesize reduction 43, result has 34.8 percent of original size 276.92/204.56 [2019-03-28 12:38:13,394 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:13,394 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 276.92/204.56 [2019-03-28 12:38:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.56 [2019-03-28 12:38:13,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core 276.92/204.56 [2019-03-28 12:38:13,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.56 [2019-03-28 12:38:13,569 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:13,569 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 64 276.92/204.56 [2019-03-28 12:38:13,573 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:13,631 INFO L497 ElimStorePlain]: treesize reduction 47, result has 48.9 percent of original size 276.92/204.56 [2019-03-28 12:38:13,632 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 276.92/204.56 [2019-03-28 12:38:13,632 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:45 276.92/204.56 [2019-03-28 12:38:13,777 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:13,778 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 64 276.92/204.56 [2019-03-28 12:38:13,781 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:13,809 INFO L497 ElimStorePlain]: treesize reduction 43, result has 34.8 percent of original size 276.92/204.56 [2019-03-28 12:38:13,810 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:13,810 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 276.92/204.56 [2019-03-28 12:38:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.56 [2019-03-28 12:38:13,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core 276.92/204.56 [2019-03-28 12:38:13,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.56 [2019-03-28 12:38:13,945 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:13,946 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 61 276.92/204.56 [2019-03-28 12:38:13,963 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:14,009 INFO L497 ElimStorePlain]: treesize reduction 42, result has 50.0 percent of original size 276.92/204.56 [2019-03-28 12:38:14,009 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:14,010 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:41 276.92/204.56 [2019-03-28 12:38:14,484 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:14,484 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 64 276.92/204.56 [2019-03-28 12:38:14,487 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:14,522 INFO L497 ElimStorePlain]: treesize reduction 35, result has 39.7 percent of original size 276.92/204.56 [2019-03-28 12:38:14,522 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:14,522 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 276.92/204.56 [2019-03-28 12:38:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.56 [2019-03-28 12:38:14,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core 276.92/204.56 [2019-03-28 12:38:14,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.56 [2019-03-28 12:38:14,748 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:14,749 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 64 276.92/204.56 [2019-03-28 12:38:14,752 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:14,808 INFO L497 ElimStorePlain]: treesize reduction 47, result has 48.9 percent of original size 276.92/204.56 [2019-03-28 12:38:14,809 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 276.92/204.56 [2019-03-28 12:38:14,809 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:45 276.92/204.56 [2019-03-28 12:38:14,953 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:14,953 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 64 276.92/204.56 [2019-03-28 12:38:14,956 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:14,986 INFO L497 ElimStorePlain]: treesize reduction 35, result has 39.7 percent of original size 276.92/204.56 [2019-03-28 12:38:14,986 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:14,986 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 276.92/204.56 [2019-03-28 12:38:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.56 [2019-03-28 12:38:15,045 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 276.92/204.56 [2019-03-28 12:38:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.56 [2019-03-28 12:38:15,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core 276.92/204.56 [2019-03-28 12:38:15,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.56 [2019-03-28 12:38:15,082 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:15,082 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 62 276.92/204.56 [2019-03-28 12:38:15,085 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:15,114 INFO L497 ElimStorePlain]: treesize reduction 35, result has 41.7 percent of original size 276.92/204.56 [2019-03-28 12:38:15,115 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:15,115 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 276.92/204.56 [2019-03-28 12:38:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.56 [2019-03-28 12:38:15,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core 276.92/204.56 [2019-03-28 12:38:15,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.56 [2019-03-28 12:38:15,225 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:15,225 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 62 276.92/204.56 [2019-03-28 12:38:15,229 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:15,262 INFO L497 ElimStorePlain]: treesize reduction 43, result has 36.8 percent of original size 276.92/204.56 [2019-03-28 12:38:15,263 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:15,263 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 276.92/204.56 [2019-03-28 12:38:15,291 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:15,292 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 69 276.92/204.56 [2019-03-28 12:38:15,294 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:15,330 INFO L497 ElimStorePlain]: treesize reduction 29, result has 56.7 percent of original size 276.92/204.56 [2019-03-28 12:38:15,331 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:15,331 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:32 276.92/204.56 [2019-03-28 12:38:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.56 [2019-03-28 12:38:15,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core 276.92/204.56 [2019-03-28 12:38:15,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.56 [2019-03-28 12:38:15,470 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:15,471 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 62 276.92/204.56 [2019-03-28 12:38:15,473 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:15,521 INFO L497 ElimStorePlain]: treesize reduction 35, result has 41.7 percent of original size 276.92/204.56 [2019-03-28 12:38:15,521 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:15,521 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 276.92/204.56 [2019-03-28 12:38:15,552 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:15,553 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 69 276.92/204.56 [2019-03-28 12:38:15,555 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:15,597 INFO L497 ElimStorePlain]: treesize reduction 45, result has 45.8 percent of original size 276.92/204.56 [2019-03-28 12:38:15,597 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:15,597 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:32 276.92/204.56 [2019-03-28 12:38:15,698 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 19 predicates after loop cannibalization 276.92/204.56 [2019-03-28 12:38:15,698 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.11 stem predicates 19 loop predicates 276.92/204.56 [2019-03-28 12:38:15,698 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 64 states and 79 transitions. cyclomatic complexity: 17 Second operand 18 states. 276.92/204.56 [2019-03-28 12:38:31,656 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 64 states and 79 transitions. cyclomatic complexity: 17. Second operand 18 states. Result 4227 states and 5033 transitions. Complement of second has 1662 states. 276.92/204.56 [2019-03-28 12:38:31,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 163 states 37 stem states 121 non-accepting loop states 4 accepting loop states 276.92/204.56 [2019-03-28 12:38:31,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 276.92/204.56 [2019-03-28 12:38:31,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 416 transitions. 276.92/204.56 [2019-03-28 12:38:31,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 416 transitions. Stem has 24 letters. Loop has 15 letters. 276.92/204.56 [2019-03-28 12:38:31,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. 276.92/204.56 [2019-03-28 12:38:31,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 416 transitions. Stem has 39 letters. Loop has 15 letters. 276.92/204.56 [2019-03-28 12:38:31,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. 276.92/204.56 [2019-03-28 12:38:31,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 163 states and 416 transitions. Stem has 24 letters. Loop has 30 letters. 276.92/204.56 [2019-03-28 12:38:31,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. 276.92/204.56 [2019-03-28 12:38:31,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4227 states and 5033 transitions. 276.92/204.56 [2019-03-28 12:38:31,694 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 817 276.92/204.56 [2019-03-28 12:38:31,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4227 states to 1314 states and 1574 transitions. 276.92/204.56 [2019-03-28 12:38:31,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 644 276.92/204.56 [2019-03-28 12:38:31,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 747 276.92/204.56 [2019-03-28 12:38:31,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1314 states and 1574 transitions. 276.92/204.56 [2019-03-28 12:38:31,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 276.92/204.56 [2019-03-28 12:38:31,703 INFO L706 BuchiCegarLoop]: Abstraction has 1314 states and 1574 transitions. 276.92/204.56 [2019-03-28 12:38:31,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states and 1574 transitions. 276.92/204.56 [2019-03-28 12:38:31,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 127. 276.92/204.56 [2019-03-28 12:38:31,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. 276.92/204.56 [2019-03-28 12:38:31,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. 276.92/204.56 [2019-03-28 12:38:31,714 INFO L729 BuchiCegarLoop]: Abstraction has 127 states and 155 transitions. 276.92/204.56 [2019-03-28 12:38:31,714 INFO L609 BuchiCegarLoop]: Abstraction has 127 states and 155 transitions. 276.92/204.56 [2019-03-28 12:38:31,714 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ 276.92/204.56 [2019-03-28 12:38:31,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 155 transitions. 276.92/204.56 [2019-03-28 12:38:31,715 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 276.92/204.56 [2019-03-28 12:38:31,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 276.92/204.56 [2019-03-28 12:38:31,715 INFO L119 BuchiIsEmpty]: Starting construction of run 276.92/204.56 [2019-03-28 12:38:31,716 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 276.92/204.56 [2019-03-28 12:38:31,716 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] 276.92/204.56 [2019-03-28 12:38:31,717 INFO L794 eck$LassoCheckResult]: Stem: 13387#ULTIMATE.startENTRY [121] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 13383#L-1 [185] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~id~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~maxId~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~id~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_main_~maxId~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_1, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_1|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~maxId~0.base, ULTIMATE.start_main_~tmp~0.offset, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~tmp~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~id~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~maxId~0.offset, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~id~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 13384#L8 [255] L8-->L9: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_14) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19) v_ULTIMATE.start_main_~id~0.offset_14 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_20|) (<= (+ v_ULTIMATE.start_main_~id~0.offset_14 4) (select |v_#length_34| v_ULTIMATE.start_main_~id~0.base_19)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~id~0.base_19))) InVars {ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 13379#L9 [256] L9-->L11: Formula: (and (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~maxId~0.base_13)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_10) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_10 4) (select |v_#length_35| v_ULTIMATE.start_main_~maxId~0.base_13)) (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13) v_ULTIMATE.start_main_~maxId~0.offset_10 |v_ULTIMATE.start_main_#t~nondet3_5|)))) InVars {ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 13380#L11 [122] L11-->L11-1: Formula: (and (= (select |v_#valid_10| v_ULTIMATE.start_main_~id~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~id~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~id~0.base_7) v_ULTIMATE.start_main_~id~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~id~0.base_7))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #valid=|v_#valid_10|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 13385#L11-1 [200] L11-1-->L11-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 13386#L11-2 [100] L11-2-->L11-3: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 13377#L11-3 [97] L11-3-->L11-4: Formula: (and (= (select |v_#valid_12| v_ULTIMATE.start_main_~id~0.base_10) 1) (<= (+ v_ULTIMATE.start_main_~id~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~id~0.base_10)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~id~0.base_10) v_ULTIMATE.start_main_~id~0.offset_8))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #valid=|v_#valid_12|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 13378#L11-4 [91] L11-4-->L11-5: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~maxId~0.base_7) v_ULTIMATE.start_main_~maxId~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_6 4) (select |v_#length_12| v_ULTIMATE.start_main_~maxId~0.base_7)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_6) (= 1 (select |v_#valid_14| v_ULTIMATE.start_main_~maxId~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 13367#L11-5 [216] L11-5-->L11-7: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< |v_ULTIMATE.start_main_#t~mem5_3| |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 13368#L11-7 [205] L11-7-->L13: Formula: (and (= |v_#valid_16| (store |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1)) |v_ULTIMATE.start_main_#t~short7_7| (= 0 (select |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2|)) (= v_ULTIMATE.start_main_~tmp~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (= (store |v_#length_15| |v_ULTIMATE.start_main_#t~malloc8.base_2| 4) |v_#length_14|) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_2|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (= v_ULTIMATE.start_main_~tmp~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_15|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_7|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_2, #valid=|v_#valid_16|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #length=|v_#length_14|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_6|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_~tmp~0.base, ULTIMATE.start_main_~tmp~0.offset, #valid, ULTIMATE.start_main_#t~malloc8.offset, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4] 13396#L13 [146] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~id~0.offset_10 4) (select |v_#length_16| v_ULTIMATE.start_main_~id~0.base_13)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_10) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~id~0.base_13) v_ULTIMATE.start_main_~id~0.offset_10)) (= (select |v_#valid_18| v_ULTIMATE.start_main_~id~0.base_13) 1)) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #valid=|v_#valid_18|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 13392#L13-1 [259] L13-1-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_15) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_15 4) (select |v_#length_36| v_ULTIMATE.start_main_~tmp~0.base_21)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21) v_ULTIMATE.start_main_~tmp~0.offset_15 (+ |v_ULTIMATE.start_main_#t~mem9_6| 1))) |v_#memory_int_24|) (= (select |v_#valid_47| v_ULTIMATE.start_main_~tmp~0.base_21) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_36|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 13393#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 13429#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 13425#L14-2 [233] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 13426#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 13471#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 13399#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 13400#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 13475#L16-1 [260] L16-1-->L18-1: Formula: (and (= (select |v_#valid_48| v_ULTIMATE.start_main_~tmp~0.base_22) 1) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~tmp~0.base_22)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_16) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22) v_ULTIMATE.start_main_~tmp~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_26|)) InVars {ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 13474#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 13473#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 13472#L14-2 [233] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 13361#L15 276.92/204.56 [2019-03-28 12:38:31,717 INFO L796 eck$LassoCheckResult]: Loop: 13361#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 13362#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 13394#L15-2 [176] L15-2-->L18: Formula: (> |v_ULTIMATE.start_main_#t~mem13_6| |v_ULTIMATE.start_main_#t~mem14_6|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_6|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_5|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 13373#L18 [94] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_13) (= 1 (select |v_#valid_34| v_ULTIMATE.start_main_~tmp~0.base_18)) (= (store |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18 (store (select |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18) v_ULTIMATE.start_main_~tmp~0.offset_13 0)) |v_#memory_int_18|) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_main_~tmp~0.base_18))) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} OutVars{#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} AuxVars[] AssignedVars[#memory_int] 13374#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 13430#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 13427#L14-2 [232] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (> |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 13428#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 13432#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 13431#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 13365#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 13357#L16-1 [260] L16-1-->L18-1: Formula: (and (= (select |v_#valid_48| v_ULTIMATE.start_main_~tmp~0.base_22) 1) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~tmp~0.base_22)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_16) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22) v_ULTIMATE.start_main_~tmp~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_26|)) InVars {ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 13358#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 13369#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 13390#L14-2 [232] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (> |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 13361#L15 276.92/204.56 [2019-03-28 12:38:31,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.92/204.56 [2019-03-28 12:38:31,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1451530251, now seen corresponding path program 1 times 276.92/204.56 [2019-03-28 12:38:31,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.92/204.56 [2019-03-28 12:38:31,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.92/204.56 [2019-03-28 12:38:31,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:31,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:31,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.56 [2019-03-28 12:38:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.56 [2019-03-28 12:38:31,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.92/204.56 [2019-03-28 12:38:31,741 INFO L82 PathProgramCache]: Analyzing trace with hash 458292287, now seen corresponding path program 5 times 276.92/204.56 [2019-03-28 12:38:31,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.92/204.56 [2019-03-28 12:38:31,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.92/204.56 [2019-03-28 12:38:31,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:31,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:31,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.56 [2019-03-28 12:38:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.56 [2019-03-28 12:38:31,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.92/204.56 [2019-03-28 12:38:31,753 INFO L82 PathProgramCache]: Analyzing trace with hash -675541259, now seen corresponding path program 1 times 276.92/204.56 [2019-03-28 12:38:31,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.92/204.56 [2019-03-28 12:38:31,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.92/204.56 [2019-03-28 12:38:31,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:31,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:31,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.56 [2019-03-28 12:38:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.56 [2019-03-28 12:38:32,006 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 276.92/204.56 [2019-03-28 12:38:32,641 WARN L188 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 127 276.92/204.56 [2019-03-28 12:38:32,768 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 78 276.92/204.56 [2019-03-28 12:38:32,771 INFO L216 LassoAnalysis]: Preferences: 276.92/204.56 [2019-03-28 12:38:32,772 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 276.92/204.56 [2019-03-28 12:38:32,772 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 276.92/204.56 [2019-03-28 12:38:32,772 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 276.92/204.56 [2019-03-28 12:38:32,772 INFO L127 ssoRankerPreferences]: Use exernal solver: false 276.92/204.56 [2019-03-28 12:38:32,772 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 276.92/204.56 [2019-03-28 12:38:32,772 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 276.92/204.56 [2019-03-28 12:38:32,772 INFO L130 ssoRankerPreferences]: Path of dumped script: 276.92/204.56 [2019-03-28 12:38:32,772 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration14_Lasso 276.92/204.56 [2019-03-28 12:38:32,773 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 276.92/204.56 [2019-03-28 12:38:32,773 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 276.92/204.56 [2019-03-28 12:38:32,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:32,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:32,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:32,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:32,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:32,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:32,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:32,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:32,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:32,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:32,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:32,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:32,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:32,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:32,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:32,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:32,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:33,062 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 276.92/204.56 [2019-03-28 12:38:33,174 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 276.92/204.56 [2019-03-28 12:38:33,518 INFO L300 LassoAnalysis]: Preprocessing complete. 276.92/204.56 [2019-03-28 12:38:33,519 INFO L497 LassoAnalysis]: Using template 'affine'. 276.92/204.56 [2019-03-28 12:38:33,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.56 [2019-03-28 12:38:33,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:33,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.56 [2019-03-28 12:38:33,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:33,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:33,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.56 [2019-03-28 12:38:33,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:33,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.56 [2019-03-28 12:38:33,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:33,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:33,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.56 [2019-03-28 12:38:33,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:33,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.56 [2019-03-28 12:38:33,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:33,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.56 [2019-03-28 12:38:33,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:33,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.56 [2019-03-28 12:38:33,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:33,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.56 [2019-03-28 12:38:33,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:33,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.56 [2019-03-28 12:38:33,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:33,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.56 [2019-03-28 12:38:33,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:33,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.56 [2019-03-28 12:38:33,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:33,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.56 [2019-03-28 12:38:33,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:33,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.56 [2019-03-28 12:38:33,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:33,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,555 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:33,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:33,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:33,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,575 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:33,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,580 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,580 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:33,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,582 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,583 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:33,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:33,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:33,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,595 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,595 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:33,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,600 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,600 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.56 [2019-03-28 12:38:33,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.56 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.56 Number of strict supporting invariants: 0 276.92/204.56 Number of non-strict supporting invariants: 1 276.92/204.56 Consider only non-deceasing supporting invariants: true 276.92/204.56 Simplify termination arguments: true 276.92/204.56 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.56 [2019-03-28 12:38:33,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.56 [2019-03-28 12:38:33,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.56 [2019-03-28 12:38:33,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.56 [2019-03-28 12:38:33,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.56 [2019-03-28 12:38:33,604 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.56 [2019-03-28 12:38:33,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.56 [2019-03-28 12:38:33,611 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 276.92/204.56 [2019-03-28 12:38:33,617 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 276.92/204.56 [2019-03-28 12:38:33,617 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. 276.92/204.56 [2019-03-28 12:38:33,617 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 276.92/204.56 [2019-03-28 12:38:33,618 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 276.92/204.56 [2019-03-28 12:38:33,618 INFO L518 LassoAnalysis]: Proved termination. 276.92/204.56 [2019-03-28 12:38:33,618 INFO L520 LassoAnalysis]: Termination argument consisting of: 276.92/204.56 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0.base) ULTIMATE.start_main_~tmp~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0.base) ULTIMATE.start_main_~tmp~0.offset)_4 276.92/204.56 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0.base) ULTIMATE.start_main_~maxId~0.offset)_4 - 1 >= 0] 276.92/204.56 [2019-03-28 12:38:33,704 INFO L297 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed 276.92/204.56 [2019-03-28 12:38:33,707 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 276.92/204.56 [2019-03-28 12:38:33,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.92/204.56 [2019-03-28 12:38:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.56 [2019-03-28 12:38:33,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 16 conjunts are in the unsatisfiable core 276.92/204.56 [2019-03-28 12:38:33,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.56 [2019-03-28 12:38:33,807 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:33,808 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 276.92/204.56 [2019-03-28 12:38:33,808 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:33,813 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:33,813 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:33,813 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 276.92/204.56 [2019-03-28 12:38:33,866 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:33,866 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 49 276.92/204.56 [2019-03-28 12:38:33,867 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:33,901 INFO L497 ElimStorePlain]: treesize reduction 18, result has 69.5 percent of original size 276.92/204.56 [2019-03-28 12:38:33,902 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:33,903 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:35 276.92/204.56 [2019-03-28 12:38:34,009 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 276.92/204.56 [2019-03-28 12:38:34,009 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:34,025 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:34,025 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:34,026 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:9 276.92/204.56 [2019-03-28 12:38:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.56 [2019-03-28 12:38:34,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core 276.92/204.56 [2019-03-28 12:38:34,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.56 [2019-03-28 12:38:34,137 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:34,137 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 62 276.92/204.56 [2019-03-28 12:38:34,139 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:34,169 INFO L497 ElimStorePlain]: treesize reduction 35, result has 41.7 percent of original size 276.92/204.56 [2019-03-28 12:38:34,170 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:34,170 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 276.92/204.56 [2019-03-28 12:38:34,279 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:34,279 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 69 276.92/204.56 [2019-03-28 12:38:34,281 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:34,315 INFO L497 ElimStorePlain]: treesize reduction 45, result has 45.8 percent of original size 276.92/204.56 [2019-03-28 12:38:34,315 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:34,315 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:32 276.92/204.56 [2019-03-28 12:38:34,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 276.92/204.56 [2019-03-28 12:38:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.56 [2019-03-28 12:38:34,865 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 276.92/204.56 [2019-03-28 12:38:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.56 [2019-03-28 12:38:34,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core 276.92/204.56 [2019-03-28 12:38:34,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.56 [2019-03-28 12:38:34,934 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:34,935 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 64 276.92/204.56 [2019-03-28 12:38:34,938 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:34,991 INFO L497 ElimStorePlain]: treesize reduction 47, result has 48.9 percent of original size 276.92/204.56 [2019-03-28 12:38:34,992 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 276.92/204.56 [2019-03-28 12:38:34,992 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:45 276.92/204.56 [2019-03-28 12:38:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.56 [2019-03-28 12:38:35,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core 276.92/204.56 [2019-03-28 12:38:35,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.56 [2019-03-28 12:38:35,550 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:35,551 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 64 276.92/204.56 [2019-03-28 12:38:35,554 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:35,609 INFO L497 ElimStorePlain]: treesize reduction 47, result has 48.9 percent of original size 276.92/204.56 [2019-03-28 12:38:35,609 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 276.92/204.56 [2019-03-28 12:38:35,610 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:45 276.92/204.56 [2019-03-28 12:38:35,739 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:35,739 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 64 276.92/204.56 [2019-03-28 12:38:35,741 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:35,769 INFO L497 ElimStorePlain]: treesize reduction 35, result has 39.7 percent of original size 276.92/204.56 [2019-03-28 12:38:35,769 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:35,769 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 276.92/204.56 [2019-03-28 12:38:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.56 [2019-03-28 12:38:35,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core 276.92/204.56 [2019-03-28 12:38:35,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.56 [2019-03-28 12:38:35,897 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:35,897 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 64 276.92/204.56 [2019-03-28 12:38:35,900 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:35,950 INFO L497 ElimStorePlain]: treesize reduction 48, result has 47.3 percent of original size 276.92/204.56 [2019-03-28 12:38:35,951 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 276.92/204.56 [2019-03-28 12:38:35,951 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:45 276.92/204.56 [2019-03-28 12:38:36,081 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:36,081 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 64 276.92/204.56 [2019-03-28 12:38:36,083 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:36,110 INFO L497 ElimStorePlain]: treesize reduction 35, result has 39.7 percent of original size 276.92/204.56 [2019-03-28 12:38:36,111 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:36,111 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 276.92/204.56 [2019-03-28 12:38:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.56 [2019-03-28 12:38:36,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core 276.92/204.56 [2019-03-28 12:38:36,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.56 [2019-03-28 12:38:36,172 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:36,173 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 64 276.92/204.56 [2019-03-28 12:38:36,175 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:36,224 INFO L497 ElimStorePlain]: treesize reduction 48, result has 47.3 percent of original size 276.92/204.56 [2019-03-28 12:38:36,225 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 276.92/204.56 [2019-03-28 12:38:36,225 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:45 276.92/204.56 [2019-03-28 12:38:36,356 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:36,356 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 64 276.92/204.56 [2019-03-28 12:38:36,359 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:36,383 INFO L497 ElimStorePlain]: treesize reduction 43, result has 34.8 percent of original size 276.92/204.56 [2019-03-28 12:38:36,383 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:36,383 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 276.92/204.56 [2019-03-28 12:38:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.56 [2019-03-28 12:38:36,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core 276.92/204.56 [2019-03-28 12:38:36,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.56 [2019-03-28 12:38:36,455 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:36,455 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 64 276.92/204.56 [2019-03-28 12:38:36,458 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:36,507 INFO L497 ElimStorePlain]: treesize reduction 48, result has 47.3 percent of original size 276.92/204.56 [2019-03-28 12:38:36,507 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 276.92/204.56 [2019-03-28 12:38:36,507 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:45 276.92/204.56 [2019-03-28 12:38:36,639 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:36,640 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 64 276.92/204.56 [2019-03-28 12:38:36,642 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:36,664 INFO L497 ElimStorePlain]: treesize reduction 43, result has 34.8 percent of original size 276.92/204.56 [2019-03-28 12:38:36,664 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:36,675 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 276.92/204.56 [2019-03-28 12:38:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.56 [2019-03-28 12:38:36,730 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 276.92/204.56 [2019-03-28 12:38:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.56 [2019-03-28 12:38:36,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core 276.92/204.56 [2019-03-28 12:38:36,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.56 [2019-03-28 12:38:36,765 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:36,765 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 62 276.92/204.56 [2019-03-28 12:38:36,768 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:36,790 INFO L497 ElimStorePlain]: treesize reduction 43, result has 36.8 percent of original size 276.92/204.56 [2019-03-28 12:38:36,790 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:36,790 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 276.92/204.56 [2019-03-28 12:38:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.56 [2019-03-28 12:38:36,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core 276.92/204.56 [2019-03-28 12:38:36,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.56 [2019-03-28 12:38:36,887 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:36,887 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 62 276.92/204.56 [2019-03-28 12:38:36,890 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:36,912 INFO L497 ElimStorePlain]: treesize reduction 43, result has 36.8 percent of original size 276.92/204.56 [2019-03-28 12:38:36,912 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:36,912 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 276.92/204.56 [2019-03-28 12:38:36,934 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:36,934 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 69 276.92/204.56 [2019-03-28 12:38:36,936 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:36,970 INFO L497 ElimStorePlain]: treesize reduction 45, result has 45.8 percent of original size 276.92/204.56 [2019-03-28 12:38:36,970 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:36,970 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:32 276.92/204.56 [2019-03-28 12:38:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.56 [2019-03-28 12:38:37,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core 276.92/204.56 [2019-03-28 12:38:37,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.56 [2019-03-28 12:38:37,071 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:37,072 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 62 276.92/204.56 [2019-03-28 12:38:37,073 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:37,101 INFO L497 ElimStorePlain]: treesize reduction 35, result has 41.7 percent of original size 276.92/204.56 [2019-03-28 12:38:37,101 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:37,101 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 276.92/204.56 [2019-03-28 12:38:37,124 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.56 [2019-03-28 12:38:37,124 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 69 276.92/204.56 [2019-03-28 12:38:37,126 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:37,154 INFO L497 ElimStorePlain]: treesize reduction 29, result has 56.7 percent of original size 276.92/204.56 [2019-03-28 12:38:37,155 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.56 [2019-03-28 12:38:37,155 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:32 276.92/204.56 [2019-03-28 12:38:37,248 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 16 predicates after loop cannibalization 276.92/204.56 [2019-03-28 12:38:37,248 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.11 stem predicates 16 loop predicates 276.92/204.56 [2019-03-28 12:38:37,249 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 127 states and 155 transitions. cyclomatic complexity: 33 Second operand 18 states. 276.92/204.56 [2019-03-28 12:38:45,143 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 127 states and 155 transitions. cyclomatic complexity: 33. Second operand 18 states. Result 4196 states and 4866 transitions. Complement of second has 989 states. 276.92/204.56 [2019-03-28 12:38:45,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 96 states 16 stem states 76 non-accepting loop states 3 accepting loop states 276.92/204.56 [2019-03-28 12:38:45,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 276.92/204.56 [2019-03-28 12:38:45,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 236 transitions. 276.92/204.56 [2019-03-28 12:38:45,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 236 transitions. Stem has 24 letters. Loop has 15 letters. 276.92/204.56 [2019-03-28 12:38:45,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. 276.92/204.56 [2019-03-28 12:38:45,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 236 transitions. Stem has 39 letters. Loop has 15 letters. 276.92/204.56 [2019-03-28 12:38:45,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. 276.92/204.56 [2019-03-28 12:38:45,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 96 states and 236 transitions. Stem has 24 letters. Loop has 30 letters. 276.92/204.56 [2019-03-28 12:38:45,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. 276.92/204.56 [2019-03-28 12:38:45,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4196 states and 4866 transitions. 276.92/204.56 [2019-03-28 12:38:45,176 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 324 276.92/204.56 [2019-03-28 12:38:45,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4196 states to 1034 states and 1212 transitions. 276.92/204.56 [2019-03-28 12:38:45,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 276.92/204.56 [2019-03-28 12:38:45,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 560 276.92/204.56 [2019-03-28 12:38:45,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1034 states and 1212 transitions. 276.92/204.56 [2019-03-28 12:38:45,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 276.92/204.56 [2019-03-28 12:38:45,184 INFO L706 BuchiCegarLoop]: Abstraction has 1034 states and 1212 transitions. 276.92/204.56 [2019-03-28 12:38:45,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states and 1212 transitions. 276.92/204.56 [2019-03-28 12:38:45,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 106. 276.92/204.56 [2019-03-28 12:38:45,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. 276.92/204.56 [2019-03-28 12:38:45,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 129 transitions. 276.92/204.56 [2019-03-28 12:38:45,190 INFO L729 BuchiCegarLoop]: Abstraction has 106 states and 129 transitions. 276.92/204.56 [2019-03-28 12:38:45,190 INFO L609 BuchiCegarLoop]: Abstraction has 106 states and 129 transitions. 276.92/204.56 [2019-03-28 12:38:45,190 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ 276.92/204.56 [2019-03-28 12:38:45,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 129 transitions. 276.92/204.56 [2019-03-28 12:38:45,191 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 276.92/204.56 [2019-03-28 12:38:45,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 276.92/204.56 [2019-03-28 12:38:45,191 INFO L119 BuchiIsEmpty]: Starting construction of run 276.92/204.56 [2019-03-28 12:38:45,192 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 276.92/204.56 [2019-03-28 12:38:45,192 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] 276.92/204.56 [2019-03-28 12:38:45,193 INFO L794 eck$LassoCheckResult]: Stem: 19501#ULTIMATE.startENTRY [121] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 19498#L-1 [185] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~id~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~maxId~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~id~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_main_~maxId~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_1, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_1|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~maxId~0.base, ULTIMATE.start_main_~tmp~0.offset, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~tmp~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~id~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~maxId~0.offset, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~id~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 19490#L8 [255] L8-->L9: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_14) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19) v_ULTIMATE.start_main_~id~0.offset_14 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_20|) (<= (+ v_ULTIMATE.start_main_~id~0.offset_14 4) (select |v_#length_34| v_ULTIMATE.start_main_~id~0.base_19)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~id~0.base_19))) InVars {ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 19491#L9 [256] L9-->L11: Formula: (and (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~maxId~0.base_13)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_10) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_10 4) (select |v_#length_35| v_ULTIMATE.start_main_~maxId~0.base_13)) (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13) v_ULTIMATE.start_main_~maxId~0.offset_10 |v_ULTIMATE.start_main_#t~nondet3_5|)))) InVars {ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 19502#L11 [122] L11-->L11-1: Formula: (and (= (select |v_#valid_10| v_ULTIMATE.start_main_~id~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~id~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~id~0.base_7) v_ULTIMATE.start_main_~id~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~id~0.base_7))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #valid=|v_#valid_10|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 19503#L11-1 [200] L11-1-->L11-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 19513#L11-2 [100] L11-2-->L11-3: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 19492#L11-3 [97] L11-3-->L11-4: Formula: (and (= (select |v_#valid_12| v_ULTIMATE.start_main_~id~0.base_10) 1) (<= (+ v_ULTIMATE.start_main_~id~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~id~0.base_10)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~id~0.base_10) v_ULTIMATE.start_main_~id~0.offset_8))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #valid=|v_#valid_12|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 19493#L11-4 [91] L11-4-->L11-5: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~maxId~0.base_7) v_ULTIMATE.start_main_~maxId~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_6 4) (select |v_#length_12| v_ULTIMATE.start_main_~maxId~0.base_7)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_6) (= 1 (select |v_#valid_14| v_ULTIMATE.start_main_~maxId~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 19482#L11-5 [216] L11-5-->L11-7: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< |v_ULTIMATE.start_main_#t~mem5_3| |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 19483#L11-7 [206] L11-7-->L13: Formula: (and (= |v_#valid_16| (store |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1)) |v_ULTIMATE.start_main_#t~short7_7| (= 0 (select |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2|)) (= v_ULTIMATE.start_main_~tmp~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (= (store |v_#length_15| |v_ULTIMATE.start_main_#t~malloc8.base_2| 4) |v_#length_14|) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_2|) (> |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (= v_ULTIMATE.start_main_~tmp~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_15|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_7|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_2, #valid=|v_#valid_16|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #length=|v_#length_14|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_6|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_~tmp~0.base, ULTIMATE.start_main_~tmp~0.offset, #valid, ULTIMATE.start_main_#t~malloc8.offset, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4] 19511#L13 [146] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~id~0.offset_10 4) (select |v_#length_16| v_ULTIMATE.start_main_~id~0.base_13)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_10) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~id~0.base_13) v_ULTIMATE.start_main_~id~0.offset_10)) (= (select |v_#valid_18| v_ULTIMATE.start_main_~id~0.base_13) 1)) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #valid=|v_#valid_18|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 19507#L13-1 [259] L13-1-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_15) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_15 4) (select |v_#length_36| v_ULTIMATE.start_main_~tmp~0.base_21)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21) v_ULTIMATE.start_main_~tmp~0.offset_15 (+ |v_ULTIMATE.start_main_#t~mem9_6| 1))) |v_#memory_int_24|) (= (select |v_#valid_47| v_ULTIMATE.start_main_~tmp~0.base_21) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_36|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 19508#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 19550#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 19549#L14-2 [233] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 19548#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 19547#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 19546#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 19545#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 19534#L16-1 [260] L16-1-->L18-1: Formula: (and (= (select |v_#valid_48| v_ULTIMATE.start_main_~tmp~0.base_22) 1) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~tmp~0.base_22)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_16) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22) v_ULTIMATE.start_main_~tmp~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_26|)) InVars {ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 19533#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 19532#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 19526#L14-2 [231] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|) (> |v_ULTIMATE.start_main_#t~nondet12_5| 0)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 19525#L15 276.92/204.56 [2019-03-28 12:38:45,194 INFO L796 eck$LassoCheckResult]: Loop: 19525#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 19524#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 19523#L15-2 [176] L15-2-->L18: Formula: (> |v_ULTIMATE.start_main_#t~mem13_6| |v_ULTIMATE.start_main_#t~mem14_6|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_6|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_5|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 19516#L18 [94] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_13) (= 1 (select |v_#valid_34| v_ULTIMATE.start_main_~tmp~0.base_18)) (= (store |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18 (store (select |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18) v_ULTIMATE.start_main_~tmp~0.offset_13 0)) |v_#memory_int_18|) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_main_~tmp~0.base_18))) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} OutVars{#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} AuxVars[] AssignedVars[#memory_int] 19522#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 19521#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 19520#L14-2 [232] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (> |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 19519#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 19518#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 19515#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 19517#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 19531#L16-1 [260] L16-1-->L18-1: Formula: (and (= (select |v_#valid_48| v_ULTIMATE.start_main_~tmp~0.base_22) 1) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~tmp~0.base_22)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_16) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22) v_ULTIMATE.start_main_~tmp~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_26|)) InVars {ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 19530#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 19529#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 19528#L14-2 [232] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (> |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 19525#L15 276.92/204.56 [2019-03-28 12:38:45,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.92/204.56 [2019-03-28 12:38:45,194 INFO L82 PathProgramCache]: Analyzing trace with hash 945971624, now seen corresponding path program 1 times 276.92/204.56 [2019-03-28 12:38:45,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.92/204.56 [2019-03-28 12:38:45,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.92/204.56 [2019-03-28 12:38:45,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:45,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:45,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.56 [2019-03-28 12:38:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.56 [2019-03-28 12:38:45,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.92/204.56 [2019-03-28 12:38:45,218 INFO L82 PathProgramCache]: Analyzing trace with hash 458292287, now seen corresponding path program 6 times 276.92/204.56 [2019-03-28 12:38:45,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.92/204.56 [2019-03-28 12:38:45,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.92/204.56 [2019-03-28 12:38:45,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:45,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:45,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.56 [2019-03-28 12:38:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.56 [2019-03-28 12:38:45,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.92/204.56 [2019-03-28 12:38:45,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1038628792, now seen corresponding path program 1 times 276.92/204.56 [2019-03-28 12:38:45,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.92/204.56 [2019-03-28 12:38:45,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.92/204.56 [2019-03-28 12:38:45,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:45,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:45,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.56 [2019-03-28 12:38:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.56 [2019-03-28 12:38:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.56 [2019-03-28 12:38:45,478 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 276.92/204.56 [2019-03-28 12:38:46,170 WARN L188 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 134 276.92/204.56 [2019-03-28 12:38:46,297 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 80 276.92/204.56 [2019-03-28 12:38:46,300 INFO L216 LassoAnalysis]: Preferences: 276.92/204.56 [2019-03-28 12:38:46,300 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 276.92/204.56 [2019-03-28 12:38:46,300 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 276.92/204.56 [2019-03-28 12:38:46,301 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 276.92/204.56 [2019-03-28 12:38:46,301 INFO L127 ssoRankerPreferences]: Use exernal solver: false 276.92/204.56 [2019-03-28 12:38:46,301 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 276.92/204.56 [2019-03-28 12:38:46,301 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 276.92/204.56 [2019-03-28 12:38:46,301 INFO L130 ssoRankerPreferences]: Path of dumped script: 276.92/204.56 [2019-03-28 12:38:46,301 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration15_Lasso 276.92/204.56 [2019-03-28 12:38:46,301 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 276.92/204.56 [2019-03-28 12:38:46,301 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 276.92/204.56 [2019-03-28 12:38:46,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:46,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:46,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:46,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:46,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:46,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:46,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:46,572 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 276.92/204.56 [2019-03-28 12:38:46,681 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 276.92/204.56 [2019-03-28 12:38:46,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:46,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.56 [2019-03-28 12:38:46,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:38:46,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:38:46,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:38:46,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:38:46,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:38:46,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:38:46,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:38:46,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:38:46,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:38:47,091 INFO L300 LassoAnalysis]: Preprocessing complete. 276.92/204.57 [2019-03-28 12:38:47,091 INFO L497 LassoAnalysis]: Using template 'affine'. 276.92/204.57 [2019-03-28 12:38:47,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:38:47,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:38:47,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.57 [2019-03-28 12:38:47,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:38:47,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:38:47,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:38:47,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:38:47,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.57 [2019-03-28 12:38:47,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:38:47,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:38:47,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:38:47,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:38:47,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:38:47,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:38:47,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:38:47,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.57 [2019-03-28 12:38:47,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:38:47,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:38:47,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:38:47,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.57 [2019-03-28 12:38:47,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:38:47,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:38:47,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:38:47,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:38:47,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.57 [2019-03-28 12:38:47,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:38:47,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:38:47,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:38:47,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.57 [2019-03-28 12:38:47,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:38:47,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:38:47,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:38:47,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:38:47,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.57 [2019-03-28 12:38:47,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:38:47,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:38:47,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:38:47,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.57 [2019-03-28 12:38:47,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:38:47,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:38:47,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:38:47,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:38:47,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.57 [2019-03-28 12:38:47,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:38:47,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:38:47,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:38:47,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.57 [2019-03-28 12:38:47,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:38:47,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:38:47,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:38:47,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:38:47,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.57 [2019-03-28 12:38:47,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:38:47,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:38:47,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:38:47,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:38:47,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:38:47,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:38:47,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:38:47,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.57 [2019-03-28 12:38:47,114 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 276.92/204.57 [2019-03-28 12:38:47,117 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 276.92/204.57 [2019-03-28 12:38:47,117 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. 276.92/204.57 [2019-03-28 12:38:47,117 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 276.92/204.57 [2019-03-28 12:38:47,118 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 276.92/204.57 [2019-03-28 12:38:47,118 INFO L518 LassoAnalysis]: Proved termination. 276.92/204.57 [2019-03-28 12:38:47,118 INFO L520 LassoAnalysis]: Termination argument consisting of: 276.92/204.57 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0.base) ULTIMATE.start_main_~tmp~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0.base) ULTIMATE.start_main_~tmp~0.offset)_5 276.92/204.57 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0.base) ULTIMATE.start_main_~maxId~0.offset)_5 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~id~0.base) ULTIMATE.start_main_~id~0.offset)_5 >= 0] 276.92/204.57 [2019-03-28 12:38:47,208 INFO L297 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed 276.92/204.57 [2019-03-28 12:38:47,211 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 276.92/204.57 [2019-03-28 12:38:47,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.92/204.57 [2019-03-28 12:38:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:38:47,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 14 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:38:47,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:38:47,406 INFO L189 IndexEqualityManager]: detected not equals via solver 276.92/204.57 [2019-03-28 12:38:47,408 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 276.92/204.57 [2019-03-28 12:38:47,408 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:38:47,419 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:38:47,420 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:38:47,420 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:23 276.92/204.57 [2019-03-28 12:38:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:38:47,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 15 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:38:47,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:38:47,677 INFO L340 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size 276.92/204.57 [2019-03-28 12:38:47,677 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 105 276.92/204.57 [2019-03-28 12:38:47,693 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:38:47,750 INFO L497 ElimStorePlain]: treesize reduction 114, result has 28.7 percent of original size 276.92/204.57 [2019-03-28 12:38:47,750 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:38:47,751 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:44 276.92/204.57 [2019-03-28 12:38:48,051 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:38:48,052 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 119 276.92/204.57 [2019-03-28 12:38:48,064 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:38:48,133 INFO L497 ElimStorePlain]: treesize reduction 121, result has 32.8 percent of original size 276.92/204.57 [2019-03-28 12:38:48,134 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:38:48,134 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:51 276.92/204.57 [2019-03-28 12:38:48,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 276.92/204.57 [2019-03-28 12:38:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.57 [2019-03-28 12:38:49,038 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 276.92/204.57 [2019-03-28 12:38:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:38:49,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:38:49,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:38:49,339 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:38:49,340 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 114 276.92/204.57 [2019-03-28 12:38:49,370 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:38:49,433 INFO L497 ElimStorePlain]: treesize reduction 159, result has 23.9 percent of original size 276.92/204.57 [2019-03-28 12:38:49,434 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:38:49,434 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 276.92/204.57 [2019-03-28 12:38:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:38:49,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:38:49,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:38:50,070 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:38:50,071 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 106 276.92/204.57 [2019-03-28 12:38:50,094 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:38:50,189 INFO L497 ElimStorePlain]: treesize reduction 131, result has 28.4 percent of original size 276.92/204.57 [2019-03-28 12:38:50,190 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 276.92/204.57 [2019-03-28 12:38:50,203 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:42 276.92/204.57 [2019-03-28 12:38:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:38:51,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:38:51,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:38:51,525 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:38:51,525 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 109 276.92/204.57 [2019-03-28 12:38:51,535 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:38:51,626 INFO L497 ElimStorePlain]: treesize reduction 168, result has 33.9 percent of original size 276.92/204.57 [2019-03-28 12:38:51,626 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:38:51,626 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:84 276.92/204.57 [2019-03-28 12:38:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:38:52,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 13 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:38:52,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:38:52,914 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:38:52,914 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 109 276.92/204.57 [2019-03-28 12:38:52,937 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:38:53,044 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 276.92/204.57 [2019-03-28 12:38:53,045 INFO L497 ElimStorePlain]: treesize reduction 233, result has 20.5 percent of original size 276.92/204.57 [2019-03-28 12:38:53,045 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 276.92/204.57 [2019-03-28 12:38:53,045 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:55 276.92/204.57 [2019-03-28 12:38:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:38:53,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 13 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:38:53,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:38:53,709 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:38:53,709 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 109 276.92/204.57 [2019-03-28 12:38:53,736 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:38:53,824 INFO L497 ElimStorePlain]: treesize reduction 149, result has 31.7 percent of original size 276.92/204.57 [2019-03-28 12:38:53,825 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 276.92/204.57 [2019-03-28 12:38:53,825 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:65 276.92/204.57 [2019-03-28 12:38:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:38:53,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 12 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:38:53,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:38:54,056 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:38:54,056 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 106 276.92/204.57 [2019-03-28 12:38:54,076 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:38:54,160 INFO L497 ElimStorePlain]: treesize reduction 171, result has 23.7 percent of original size 276.92/204.57 [2019-03-28 12:38:54,161 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 276.92/204.57 [2019-03-28 12:38:54,161 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:42 276.92/204.57 [2019-03-28 12:38:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:38:54,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:38:54,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:38:54,272 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:38:54,272 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 54 276.92/204.57 [2019-03-28 12:38:54,277 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:38:54,305 INFO L497 ElimStorePlain]: treesize reduction 26, result has 50.0 percent of original size 276.92/204.57 [2019-03-28 12:38:54,305 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:38:54,306 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:25 276.92/204.57 [2019-03-28 12:38:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:38:54,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 12 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:38:54,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:38:54,616 INFO L340 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size 276.92/204.57 [2019-03-28 12:38:54,616 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 105 276.92/204.57 [2019-03-28 12:38:54,641 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:38:54,693 INFO L497 ElimStorePlain]: treesize reduction 144, result has 24.2 percent of original size 276.92/204.57 [2019-03-28 12:38:54,693 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:38:54,694 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:44 276.92/204.57 [2019-03-28 12:38:54,855 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:38:54,856 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 119 276.92/204.57 [2019-03-28 12:38:54,865 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:38:54,928 INFO L497 ElimStorePlain]: treesize reduction 121, result has 32.8 percent of original size 276.92/204.57 [2019-03-28 12:38:54,929 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:38:54,929 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:51 276.92/204.57 [2019-03-28 12:38:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:38:55,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 12 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:38:55,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:38:55,240 INFO L340 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size 276.92/204.57 [2019-03-28 12:38:55,240 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 105 276.92/204.57 [2019-03-28 12:38:55,253 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:38:55,304 INFO L497 ElimStorePlain]: treesize reduction 118, result has 28.0 percent of original size 276.92/204.57 [2019-03-28 12:38:55,305 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:38:55,305 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:44 276.92/204.57 [2019-03-28 12:38:55,388 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:38:55,389 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 119 276.92/204.57 [2019-03-28 12:38:55,398 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:38:55,461 INFO L497 ElimStorePlain]: treesize reduction 124, result has 32.2 percent of original size 276.92/204.57 [2019-03-28 12:38:55,461 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:38:55,461 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:51 276.92/204.57 [2019-03-28 12:38:55,616 INFO L98 LoopCannibalizer]: 15 predicates before loop cannibalization 44 predicates after loop cannibalization 276.92/204.57 [2019-03-28 12:38:55,616 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 44 loop predicates 276.92/204.57 [2019-03-28 12:38:55,617 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 106 states and 129 transitions. cyclomatic complexity: 27 Second operand 22 states. 276.92/204.57 [2019-03-28 12:39:11,127 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 276.92/204.57 [2019-03-28 12:39:13,216 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 276.92/204.57 [2019-03-28 12:39:18,865 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 276.92/204.57 [2019-03-28 12:39:20,421 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 276.92/204.57 [2019-03-28 12:39:22,274 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 276.92/204.57 [2019-03-28 12:39:25,446 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 276.92/204.57 [2019-03-28 12:39:26,971 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 276.92/204.57 [2019-03-28 12:39:28,934 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 31 276.92/204.57 [2019-03-28 12:39:30,713 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 276.92/204.57 [2019-03-28 12:39:37,528 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 106 states and 129 transitions. cyclomatic complexity: 27. Second operand 22 states. Result 6904 states and 7988 transitions. Complement of second has 2650 states. 276.92/204.57 [2019-03-28 12:39:37,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 217 states 33 stem states 176 non-accepting loop states 7 accepting loop states 276.92/204.57 [2019-03-28 12:39:37,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 276.92/204.57 [2019-03-28 12:39:37,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 369 transitions. 276.92/204.57 [2019-03-28 12:39:37,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 369 transitions. Stem has 24 letters. Loop has 15 letters. 276.92/204.57 [2019-03-28 12:39:37,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. 276.92/204.57 [2019-03-28 12:39:37,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 369 transitions. Stem has 39 letters. Loop has 15 letters. 276.92/204.57 [2019-03-28 12:39:37,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. 276.92/204.57 [2019-03-28 12:39:37,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 369 transitions. Stem has 24 letters. Loop has 30 letters. 276.92/204.57 [2019-03-28 12:39:37,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. 276.92/204.57 [2019-03-28 12:39:37,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6904 states and 7988 transitions. 276.92/204.57 [2019-03-28 12:39:37,584 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 253 276.92/204.57 [2019-03-28 12:39:37,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6904 states to 711 states and 823 transitions. 276.92/204.57 [2019-03-28 12:39:37,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 389 276.92/204.57 [2019-03-28 12:39:37,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 397 276.92/204.57 [2019-03-28 12:39:37,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 711 states and 823 transitions. 276.92/204.57 [2019-03-28 12:39:37,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 276.92/204.57 [2019-03-28 12:39:37,590 INFO L706 BuchiCegarLoop]: Abstraction has 711 states and 823 transitions. 276.92/204.57 [2019-03-28 12:39:37,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states and 823 transitions. 276.92/204.57 [2019-03-28 12:39:37,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 152. 276.92/204.57 [2019-03-28 12:39:37,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. 276.92/204.57 [2019-03-28 12:39:37,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 180 transitions. 276.92/204.57 [2019-03-28 12:39:37,597 INFO L729 BuchiCegarLoop]: Abstraction has 152 states and 180 transitions. 276.92/204.57 [2019-03-28 12:39:37,598 INFO L609 BuchiCegarLoop]: Abstraction has 152 states and 180 transitions. 276.92/204.57 [2019-03-28 12:39:37,598 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ 276.92/204.57 [2019-03-28 12:39:37,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 180 transitions. 276.92/204.57 [2019-03-28 12:39:37,599 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 53 276.92/204.57 [2019-03-28 12:39:37,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 276.92/204.57 [2019-03-28 12:39:37,599 INFO L119 BuchiIsEmpty]: Starting construction of run 276.92/204.57 [2019-03-28 12:39:37,599 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 276.92/204.57 [2019-03-28 12:39:37,599 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1] 276.92/204.57 [2019-03-28 12:39:37,600 INFO L794 eck$LassoCheckResult]: Stem: 30305#ULTIMATE.startENTRY [121] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 30301#L-1 [185] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~id~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~maxId~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~id~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_main_~maxId~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_1, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_1|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~maxId~0.base, ULTIMATE.start_main_~tmp~0.offset, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~tmp~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~id~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~maxId~0.offset, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~id~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 30302#L8 [255] L8-->L9: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_14) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19) v_ULTIMATE.start_main_~id~0.offset_14 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_20|) (<= (+ v_ULTIMATE.start_main_~id~0.offset_14 4) (select |v_#length_34| v_ULTIMATE.start_main_~id~0.base_19)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~id~0.base_19))) InVars {ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 30297#L9 [256] L9-->L11: Formula: (and (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~maxId~0.base_13)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_10) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_10 4) (select |v_#length_35| v_ULTIMATE.start_main_~maxId~0.base_13)) (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13) v_ULTIMATE.start_main_~maxId~0.offset_10 |v_ULTIMATE.start_main_#t~nondet3_5|)))) InVars {ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 30298#L11 [122] L11-->L11-1: Formula: (and (= (select |v_#valid_10| v_ULTIMATE.start_main_~id~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~id~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~id~0.base_7) v_ULTIMATE.start_main_~id~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~id~0.base_7))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #valid=|v_#valid_10|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 30303#L11-1 [200] L11-1-->L11-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 30304#L11-2 [100] L11-2-->L11-3: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 30295#L11-3 [97] L11-3-->L11-4: Formula: (and (= (select |v_#valid_12| v_ULTIMATE.start_main_~id~0.base_10) 1) (<= (+ v_ULTIMATE.start_main_~id~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~id~0.base_10)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~id~0.base_10) v_ULTIMATE.start_main_~id~0.offset_8))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #valid=|v_#valid_12|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 30296#L11-4 [91] L11-4-->L11-5: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~maxId~0.base_7) v_ULTIMATE.start_main_~maxId~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_6 4) (select |v_#length_12| v_ULTIMATE.start_main_~maxId~0.base_7)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_6) (= 1 (select |v_#valid_14| v_ULTIMATE.start_main_~maxId~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 30283#L11-5 [216] L11-5-->L11-7: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< |v_ULTIMATE.start_main_#t~mem5_3| |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 30284#L11-7 [205] L11-7-->L13: Formula: (and (= |v_#valid_16| (store |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1)) |v_ULTIMATE.start_main_#t~short7_7| (= 0 (select |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2|)) (= v_ULTIMATE.start_main_~tmp~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (= (store |v_#length_15| |v_ULTIMATE.start_main_#t~malloc8.base_2| 4) |v_#length_14|) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_2|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (= v_ULTIMATE.start_main_~tmp~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_15|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_7|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_2, #valid=|v_#valid_16|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #length=|v_#length_14|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_6|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_~tmp~0.base, ULTIMATE.start_main_~tmp~0.offset, #valid, ULTIMATE.start_main_#t~malloc8.offset, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4] 30319#L13 [146] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~id~0.offset_10 4) (select |v_#length_16| v_ULTIMATE.start_main_~id~0.base_13)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_10) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~id~0.base_13) v_ULTIMATE.start_main_~id~0.offset_10)) (= (select |v_#valid_18| v_ULTIMATE.start_main_~id~0.base_13) 1)) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #valid=|v_#valid_18|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 30340#L13-1 [259] L13-1-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_15) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_15 4) (select |v_#length_36| v_ULTIMATE.start_main_~tmp~0.base_21)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21) v_ULTIMATE.start_main_~tmp~0.offset_15 (+ |v_ULTIMATE.start_main_#t~mem9_6| 1))) |v_#memory_int_24|) (= (select |v_#valid_47| v_ULTIMATE.start_main_~tmp~0.base_21) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_36|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 30339#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 30338#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 30337#L14-2 [233] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 30335#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 30336#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 30351#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 30347#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 30349#L16-1 [260] L16-1-->L18-1: Formula: (and (= (select |v_#valid_48| v_ULTIMATE.start_main_~tmp~0.base_22) 1) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~tmp~0.base_22)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_16) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22) v_ULTIMATE.start_main_~tmp~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_26|)) InVars {ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 30382#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 30381#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 30380#L14-2 [233] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 30277#L15 276.92/204.57 [2019-03-28 12:39:37,601 INFO L796 eck$LassoCheckResult]: Loop: 30277#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 30278#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 30312#L15-2 [176] L15-2-->L18: Formula: (> |v_ULTIMATE.start_main_#t~mem13_6| |v_ULTIMATE.start_main_#t~mem14_6|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_6|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_5|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 30313#L18 [94] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_13) (= 1 (select |v_#valid_34| v_ULTIMATE.start_main_~tmp~0.base_18)) (= (store |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18 (store (select |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18) v_ULTIMATE.start_main_~tmp~0.offset_13 0)) |v_#memory_int_18|) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_main_~tmp~0.base_18))) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} OutVars{#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} AuxVars[] AssignedVars[#memory_int] 30374#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 30373#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 30372#L14-2 [232] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (> |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 30358#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 30354#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 30353#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 30281#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 30275#L16-1 [260] L16-1-->L18-1: Formula: (and (= (select |v_#valid_48| v_ULTIMATE.start_main_~tmp~0.base_22) 1) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~tmp~0.base_22)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_16) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22) v_ULTIMATE.start_main_~tmp~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_26|)) InVars {ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 30276#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 30286#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 30309#L14-2 [232] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (> |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 30279#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 30280#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 30314#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 30315#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 30273#L16-1 [260] L16-1-->L18-1: Formula: (and (= (select |v_#valid_48| v_ULTIMATE.start_main_~tmp~0.base_22) 1) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~tmp~0.base_22)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_16) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22) v_ULTIMATE.start_main_~tmp~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_26|)) InVars {ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 30274#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 30285#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 30392#L14-2 [232] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (> |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 30277#L15 276.92/204.57 [2019-03-28 12:39:37,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.92/204.57 [2019-03-28 12:39:37,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1451530251, now seen corresponding path program 2 times 276.92/204.57 [2019-03-28 12:39:37,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.92/204.57 [2019-03-28 12:39:37,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.92/204.57 [2019-03-28 12:39:37,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:39:37,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:39:37,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:39:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.57 [2019-03-28 12:39:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.57 [2019-03-28 12:39:37,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.92/204.57 [2019-03-28 12:39:37,621 INFO L82 PathProgramCache]: Analyzing trace with hash -775343961, now seen corresponding path program 7 times 276.92/204.57 [2019-03-28 12:39:37,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.92/204.57 [2019-03-28 12:39:37,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.92/204.57 [2019-03-28 12:39:37,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:39:37,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:39:37,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:39:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.57 [2019-03-28 12:39:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.57 [2019-03-28 12:39:37,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.92/204.57 [2019-03-28 12:39:37,634 INFO L82 PathProgramCache]: Analyzing trace with hash 732507485, now seen corresponding path program 2 times 276.92/204.57 [2019-03-28 12:39:37,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.92/204.57 [2019-03-28 12:39:37,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.92/204.57 [2019-03-28 12:39:37,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:39:37,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:39:37,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:39:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.57 [2019-03-28 12:39:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.57 [2019-03-28 12:39:38,007 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 102 276.92/204.57 [2019-03-28 12:39:38,632 WARN L188 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 133 276.92/204.57 [2019-03-28 12:39:38,774 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 79 276.92/204.57 [2019-03-28 12:39:38,777 INFO L216 LassoAnalysis]: Preferences: 276.92/204.57 [2019-03-28 12:39:38,778 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 276.92/204.57 [2019-03-28 12:39:38,778 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 276.92/204.57 [2019-03-28 12:39:38,778 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 276.92/204.57 [2019-03-28 12:39:38,778 INFO L127 ssoRankerPreferences]: Use exernal solver: false 276.92/204.57 [2019-03-28 12:39:38,778 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 276.92/204.57 [2019-03-28 12:39:38,778 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 276.92/204.57 [2019-03-28 12:39:38,778 INFO L130 ssoRankerPreferences]: Path of dumped script: 276.92/204.57 [2019-03-28 12:39:38,778 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration16_Lasso 276.92/204.57 [2019-03-28 12:39:38,779 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 276.92/204.57 [2019-03-28 12:39:38,779 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 276.92/204.57 [2019-03-28 12:39:38,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:39:38,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:39:38,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:39:38,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:39:38,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:39:38,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:39:38,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:39:38,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:39:38,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:39:38,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:39:38,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:39:38,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:39:38,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:39:38,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:39:39,072 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 276.92/204.57 [2019-03-28 12:39:39,179 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 276.92/204.57 [2019-03-28 12:39:39,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:39:39,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:39:39,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:39:39,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:39:39,545 INFO L300 LassoAnalysis]: Preprocessing complete. 276.92/204.57 [2019-03-28 12:39:39,546 INFO L497 LassoAnalysis]: Using template 'affine'. 276.92/204.57 [2019-03-28 12:39:39,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:39:39,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:39:39,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:39:39,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:39:39,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:39:39,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:39:39,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.57 [2019-03-28 12:39:39,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:39:39,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:39:39,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:39:39,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.57 [2019-03-28 12:39:39,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:39:39,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:39:39,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:39:39,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:39:39,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.57 [2019-03-28 12:39:39,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:39:39,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:39:39,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:39:39,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.57 [2019-03-28 12:39:39,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:39:39,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:39:39,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:39:39,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:39:39,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.57 [2019-03-28 12:39:39,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:39:39,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:39:39,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:39:39,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.57 [2019-03-28 12:39:39,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:39:39,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:39:39,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:39:39,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:39:39,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.57 [2019-03-28 12:39:39,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:39:39,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:39:39,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:39:39,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.57 [2019-03-28 12:39:39,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:39:39,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:39:39,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:39:39,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:39:39,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.57 [2019-03-28 12:39:39,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:39:39,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:39:39,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:39:39,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:39:39,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:39:39,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:39:39,557 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:39:39,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.57 [2019-03-28 12:39:39,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:39:39,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:39:39,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:39:39,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:39:39,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:39:39,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:39:39,560 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:39:39,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.57 [2019-03-28 12:39:39,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:39:39,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:39:39,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:39:39,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.57 [2019-03-28 12:39:39,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:39:39,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:39:39,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:39:39,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:39:39,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.57 [2019-03-28 12:39:39,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:39:39,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:39:39,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:39:39,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.57 [2019-03-28 12:39:39,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:39:39,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:39:39,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:39:39,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:39:39,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.57 [2019-03-28 12:39:39,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:39:39,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:39:39,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:39:39,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.57 [2019-03-28 12:39:39,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:39:39,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:39:39,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:39:39,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:39:39,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.57 [2019-03-28 12:39:39,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:39:39,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:39:39,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:39:39,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.57 [2019-03-28 12:39:39,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:39:39,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:39:39,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:39:39,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:39:39,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.57 [2019-03-28 12:39:39,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:39:39,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:39:39,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:39:39,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.57 [2019-03-28 12:39:39,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:39:39,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:39:39,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:39:39,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:39:39,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.57 [2019-03-28 12:39:39,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:39:39,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:39:39,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:39:39,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.57 [2019-03-28 12:39:39,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:39:39,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:39:39,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:39:39,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:39:39,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.57 [2019-03-28 12:39:39,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:39:39,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:39:39,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:39:39,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:39:39,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:39:39,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:39:39,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:39:39,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.57 [2019-03-28 12:39:39,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:39:39,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:39:39,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:39:39,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:39:39,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:39:39,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:39:39,578 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:39:39,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.57 [2019-03-28 12:39:39,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:39:39,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:39:39,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:39:39,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:39:39,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:39:39,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:39:39,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:39:39,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.57 [2019-03-28 12:39:39,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:39:39,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:39:39,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:39:39,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:39:39,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:39:39,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:39:39,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:39:39,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.57 [2019-03-28 12:39:39,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:39:39,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:39:39,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:39:39,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:39:39,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:39:39,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:39:39,596 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:39:39,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.57 [2019-03-28 12:39:39,604 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 276.92/204.57 [2019-03-28 12:39:39,612 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 276.92/204.57 [2019-03-28 12:39:39,612 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. 276.92/204.57 [2019-03-28 12:39:39,612 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 276.92/204.57 [2019-03-28 12:39:39,613 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 276.92/204.57 [2019-03-28 12:39:39,613 INFO L518 LassoAnalysis]: Proved termination. 276.92/204.57 [2019-03-28 12:39:39,613 INFO L520 LassoAnalysis]: Termination argument consisting of: 276.92/204.57 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0.base) ULTIMATE.start_main_~tmp~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0.base) ULTIMATE.start_main_~tmp~0.offset)_6 276.92/204.57 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0.base) ULTIMATE.start_main_~maxId~0.offset)_6 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~id~0.base) ULTIMATE.start_main_~id~0.offset)_6 >= 0] 276.92/204.57 [2019-03-28 12:39:39,709 INFO L297 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed 276.92/204.57 [2019-03-28 12:39:39,711 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 276.92/204.57 [2019-03-28 12:39:39,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.92/204.57 [2019-03-28 12:39:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:39:39,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 16 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:39:39,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:39:39,772 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:39:39,772 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 276.92/204.57 [2019-03-28 12:39:39,773 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:39,775 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:39:39,776 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:39,776 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:6 276.92/204.57 [2019-03-28 12:39:39,863 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 276.92/204.57 [2019-03-28 12:39:39,863 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:39,870 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:39:39,871 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:39,871 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:19 276.92/204.57 [2019-03-28 12:39:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:39:39,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 17 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:39:39,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:39:40,104 INFO L340 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size 276.92/204.57 [2019-03-28 12:39:40,104 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 105 276.92/204.57 [2019-03-28 12:39:40,123 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:40,177 INFO L497 ElimStorePlain]: treesize reduction 137, result has 25.5 percent of original size 276.92/204.57 [2019-03-28 12:39:40,178 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:40,178 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:44 276.92/204.57 [2019-03-28 12:39:40,450 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:39:40,451 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 119 276.92/204.57 [2019-03-28 12:39:40,461 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:40,523 INFO L497 ElimStorePlain]: treesize reduction 139, result has 29.4 percent of original size 276.92/204.57 [2019-03-28 12:39:40,523 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:40,523 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:51 276.92/204.57 [2019-03-28 12:39:40,801 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:39:40,801 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 61 276.92/204.57 [2019-03-28 12:39:40,802 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:40,827 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:39:40,827 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 61 276.92/204.57 [2019-03-28 12:39:40,828 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:40,852 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:39:40,853 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 61 276.92/204.57 [2019-03-28 12:39:40,853 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:40,869 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:39:40,869 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 61 276.92/204.57 [2019-03-28 12:39:40,870 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:40,998 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 276.92/204.57 [2019-03-28 12:39:40,999 INFO L497 ElimStorePlain]: treesize reduction 80, result has 70.7 percent of original size 276.92/204.57 [2019-03-28 12:39:41,000 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. 276.92/204.57 [2019-03-28 12:39:41,000 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:253, output treesize:173 276.92/204.57 [2019-03-28 12:39:41,277 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 276.92/204.57 [2019-03-28 12:39:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.57 [2019-03-28 12:39:42,144 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 276.92/204.57 [2019-03-28 12:39:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:39:42,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:39:42,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:39:42,465 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:39:42,465 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 114 276.92/204.57 [2019-03-28 12:39:42,474 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:42,520 INFO L497 ElimStorePlain]: treesize reduction 91, result has 29.5 percent of original size 276.92/204.57 [2019-03-28 12:39:42,520 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:42,521 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:28 276.92/204.57 [2019-03-28 12:39:43,000 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:39:43,001 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 50 276.92/204.57 [2019-03-28 12:39:43,001 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:43,024 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:39:43,025 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 50 276.92/204.57 [2019-03-28 12:39:43,025 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:43,050 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:39:43,050 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 50 276.92/204.57 [2019-03-28 12:39:43,050 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:43,064 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:39:43,065 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 50 276.92/204.57 [2019-03-28 12:39:43,065 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:43,141 INFO L497 ElimStorePlain]: treesize reduction 80, result has 59.4 percent of original size 276.92/204.57 [2019-03-28 12:39:43,142 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. 276.92/204.57 [2019-03-28 12:39:43,142 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:161, output treesize:81 276.92/204.57 [2019-03-28 12:39:43,458 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:39:43,459 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 51 276.92/204.57 [2019-03-28 12:39:43,465 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:43,485 INFO L497 ElimStorePlain]: treesize reduction 15, result has 59.5 percent of original size 276.92/204.57 [2019-03-28 12:39:43,485 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:43,485 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 276.92/204.57 [2019-03-28 12:39:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:39:43,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:39:43,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:39:43,856 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:39:43,857 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 109 276.92/204.57 [2019-03-28 12:39:43,877 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:43,958 INFO L497 ElimStorePlain]: treesize reduction 181, result has 27.6 percent of original size 276.92/204.57 [2019-03-28 12:39:43,959 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 276.92/204.57 [2019-03-28 12:39:43,959 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:65 276.92/204.57 [2019-03-28 12:39:44,432 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:39:44,432 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 108 276.92/204.57 [2019-03-28 12:39:44,440 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:44,494 INFO L497 ElimStorePlain]: treesize reduction 167, result has 19.3 percent of original size 276.92/204.57 [2019-03-28 12:39:44,495 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:44,495 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:39 276.92/204.57 [2019-03-28 12:39:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:39:45,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:39:45,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:39:45,872 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:39:45,872 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 106 276.92/204.57 [2019-03-28 12:39:45,888 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:45,975 INFO L497 ElimStorePlain]: treesize reduction 195, result has 21.4 percent of original size 276.92/204.57 [2019-03-28 12:39:45,976 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 276.92/204.57 [2019-03-28 12:39:45,976 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:42 276.92/204.57 [2019-03-28 12:39:46,520 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:39:46,521 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 111 276.92/204.57 [2019-03-28 12:39:46,532 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:46,559 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:39:46,559 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 72 276.92/204.57 [2019-03-28 12:39:46,561 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:46,652 INFO L497 ElimStorePlain]: treesize reduction 141, result has 39.0 percent of original size 276.92/204.57 [2019-03-28 12:39:46,652 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 276.92/204.57 [2019-03-28 12:39:46,652 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:93, output treesize:73 276.92/204.57 [2019-03-28 12:39:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:39:47,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 19 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:39:47,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:39:47,546 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:39:47,546 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 109 276.92/204.57 [2019-03-28 12:39:47,562 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:47,643 INFO L497 ElimStorePlain]: treesize reduction 138, result has 30.3 percent of original size 276.92/204.57 [2019-03-28 12:39:47,644 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 276.92/204.57 [2019-03-28 12:39:47,644 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:55 276.92/204.57 [2019-03-28 12:39:47,869 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:39:47,869 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 108 276.92/204.57 [2019-03-28 12:39:47,876 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:47,922 INFO L497 ElimStorePlain]: treesize reduction 119, result has 25.6 percent of original size 276.92/204.57 [2019-03-28 12:39:47,922 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:47,922 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:39 276.92/204.57 [2019-03-28 12:39:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:39:48,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 15 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:39:48,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:39:48,175 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:39:48,175 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 109 276.92/204.57 [2019-03-28 12:39:48,192 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:48,284 INFO L497 ElimStorePlain]: treesize reduction 173, result has 28.5 percent of original size 276.92/204.57 [2019-03-28 12:39:48,284 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 276.92/204.57 [2019-03-28 12:39:48,285 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:65 276.92/204.57 [2019-03-28 12:39:48,798 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:39:48,798 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 84 276.92/204.57 [2019-03-28 12:39:48,802 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:48,809 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 276.92/204.57 [2019-03-28 12:39:48,810 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:48,817 INFO L189 IndexEqualityManager]: detected not equals via solver 276.92/204.57 [2019-03-28 12:39:48,818 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 1 276.92/204.57 [2019-03-28 12:39:48,818 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:48,863 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:39:48,864 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 84 276.92/204.57 [2019-03-28 12:39:48,868 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:48,898 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:39:48,899 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 72 276.92/204.57 [2019-03-28 12:39:48,901 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:48,907 INFO L189 IndexEqualityManager]: detected not equals via solver 276.92/204.57 [2019-03-28 12:39:48,907 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 1 276.92/204.57 [2019-03-28 12:39:48,908 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:49,021 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 276.92/204.57 [2019-03-28 12:39:49,021 INFO L497 ElimStorePlain]: treesize reduction 262, result has 27.6 percent of original size 276.92/204.57 [2019-03-28 12:39:49,021 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. 276.92/204.57 [2019-03-28 12:39:49,022 INFO L217 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:215, output treesize:67 276.92/204.57 [2019-03-28 12:39:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:39:49,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:39:49,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:39:49,798 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:39:49,799 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 106 276.92/204.57 [2019-03-28 12:39:49,817 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:49,899 INFO L497 ElimStorePlain]: treesize reduction 126, result has 32.6 percent of original size 276.92/204.57 [2019-03-28 12:39:49,900 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 276.92/204.57 [2019-03-28 12:39:49,900 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:51 276.92/204.57 [2019-03-28 12:39:49,997 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:39:49,997 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 72 276.92/204.57 [2019-03-28 12:39:50,000 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:50,090 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:39:50,090 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 111 276.92/204.57 [2019-03-28 12:39:50,112 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:50,216 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 276.92/204.57 [2019-03-28 12:39:50,216 INFO L497 ElimStorePlain]: treesize reduction 178, result has 33.6 percent of original size 276.92/204.57 [2019-03-28 12:39:50,217 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 276.92/204.57 [2019-03-28 12:39:50,217 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:93, output treesize:73 276.92/204.57 [2019-03-28 12:39:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:39:50,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:39:50,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:39:50,841 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:39:50,842 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 114 276.92/204.57 [2019-03-28 12:39:50,865 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:50,921 INFO L497 ElimStorePlain]: treesize reduction 184, result has 21.7 percent of original size 276.92/204.57 [2019-03-28 12:39:50,922 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:50,922 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 276.92/204.57 [2019-03-28 12:39:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:39:51,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 13 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:39:51,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:39:51,604 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:39:51,604 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 106 276.92/204.57 [2019-03-28 12:39:51,619 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:51,717 INFO L497 ElimStorePlain]: treesize reduction 179, result has 22.5 percent of original size 276.92/204.57 [2019-03-28 12:39:51,718 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 276.92/204.57 [2019-03-28 12:39:51,718 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:42 276.92/204.57 [2019-03-28 12:39:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:39:51,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 13 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:39:51,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:39:51,827 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:39:51,828 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 106 276.92/204.57 [2019-03-28 12:39:51,843 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:51,968 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 31 276.92/204.57 [2019-03-28 12:39:51,968 INFO L497 ElimStorePlain]: treesize reduction 196, result has 21.0 percent of original size 276.92/204.57 [2019-03-28 12:39:51,969 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 276.92/204.57 [2019-03-28 12:39:51,969 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:42 276.92/204.57 [2019-03-28 12:39:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:39:51,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 15 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:39:51,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:39:52,180 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:39:52,181 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 106 276.92/204.57 [2019-03-28 12:39:52,187 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:52,285 INFO L497 ElimStorePlain]: treesize reduction 118, result has 40.4 percent of original size 276.92/204.57 [2019-03-28 12:39:52,285 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:52,286 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:80 276.92/204.57 [2019-03-28 12:39:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:39:53,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:39:53,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:39:53,396 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:39:53,397 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 109 276.92/204.57 [2019-03-28 12:39:53,417 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:53,504 INFO L497 ElimStorePlain]: treesize reduction 146, result has 32.1 percent of original size 276.92/204.57 [2019-03-28 12:39:53,505 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 276.92/204.57 [2019-03-28 12:39:53,505 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:65 276.92/204.57 [2019-03-28 12:39:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:39:53,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 13 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:39:53,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:39:53,696 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:39:53,696 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 106 276.92/204.57 [2019-03-28 12:39:53,713 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:53,779 INFO L497 ElimStorePlain]: treesize reduction 108, result has 32.5 percent of original size 276.92/204.57 [2019-03-28 12:39:53,780 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 276.92/204.57 [2019-03-28 12:39:53,780 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:42 276.92/204.57 [2019-03-28 12:39:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:39:53,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:39:53,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:39:53,894 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:39:53,894 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 54 276.92/204.57 [2019-03-28 12:39:53,900 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:53,923 INFO L497 ElimStorePlain]: treesize reduction 15, result has 62.5 percent of original size 276.92/204.57 [2019-03-28 12:39:53,924 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:53,924 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:25 276.92/204.57 [2019-03-28 12:39:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:39:54,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 23 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:39:54,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:39:54,206 INFO L340 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size 276.92/204.57 [2019-03-28 12:39:54,206 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 105 276.92/204.57 [2019-03-28 12:39:54,217 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:54,270 INFO L497 ElimStorePlain]: treesize reduction 114, result has 28.7 percent of original size 276.92/204.57 [2019-03-28 12:39:54,271 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:54,271 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:44 276.92/204.57 [2019-03-28 12:39:54,552 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:39:54,553 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 119 276.92/204.57 [2019-03-28 12:39:54,563 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:54,634 INFO L497 ElimStorePlain]: treesize reduction 163, result has 26.6 percent of original size 276.92/204.57 [2019-03-28 12:39:54,634 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:54,634 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:51 276.92/204.57 [2019-03-28 12:39:55,318 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:39:55,319 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 119 276.92/204.57 [2019-03-28 12:39:55,335 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:55,404 INFO L497 ElimStorePlain]: treesize reduction 175, result has 27.1 percent of original size 276.92/204.57 [2019-03-28 12:39:55,405 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:55,405 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:55 276.92/204.57 [2019-03-28 12:39:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:39:55,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 17 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:39:55,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:39:55,781 INFO L340 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size 276.92/204.57 [2019-03-28 12:39:55,782 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 105 276.92/204.57 [2019-03-28 12:39:55,793 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:55,841 INFO L497 ElimStorePlain]: treesize reduction 98, result has 31.9 percent of original size 276.92/204.57 [2019-03-28 12:39:55,842 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:55,842 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:44 276.92/204.57 [2019-03-28 12:39:55,923 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:39:55,924 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 119 276.92/204.57 [2019-03-28 12:39:55,932 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:55,995 INFO L497 ElimStorePlain]: treesize reduction 124, result has 32.2 percent of original size 276.92/204.57 [2019-03-28 12:39:55,996 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:55,996 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:51 276.92/204.57 [2019-03-28 12:39:56,080 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 276.92/204.57 [2019-03-28 12:39:56,080 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 119 276.92/204.57 [2019-03-28 12:39:56,095 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:56,167 INFO L497 ElimStorePlain]: treesize reduction 167, result has 28.0 percent of original size 276.92/204.57 [2019-03-28 12:39:56,168 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:39:56,168 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:55 276.92/204.57 [2019-03-28 12:39:56,382 INFO L98 LoopCannibalizer]: 16 predicates before loop cannibalization 52 predicates after loop cannibalization 276.92/204.57 [2019-03-28 12:39:56,382 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 52 loop predicates 276.92/204.57 [2019-03-28 12:39:56,382 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 152 states and 180 transitions. cyclomatic complexity: 34 Second operand 24 states. 276.92/204.57 [2019-03-28 12:40:05,415 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 28 276.92/204.57 [2019-03-28 12:40:06,065 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 276.92/204.57 [2019-03-28 12:40:10,273 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 33 276.92/204.57 [2019-03-28 12:40:11,518 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 276.92/204.57 [2019-03-28 12:40:14,827 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 28 276.92/204.57 [2019-03-28 12:40:15,373 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 276.92/204.57 [2019-03-28 12:40:20,231 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 32 276.92/204.57 [2019-03-28 12:40:26,084 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 152 states and 180 transitions. cyclomatic complexity: 34. Second operand 24 states. Result 2472 states and 2796 transitions. Complement of second has 1125 states. 276.92/204.57 [2019-03-28 12:40:26,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 133 states 13 stem states 116 non-accepting loop states 3 accepting loop states 276.92/204.57 [2019-03-28 12:40:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 276.92/204.57 [2019-03-28 12:40:26,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 209 transitions. 276.92/204.57 [2019-03-28 12:40:26,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 209 transitions. Stem has 24 letters. Loop has 23 letters. 276.92/204.57 [2019-03-28 12:40:26,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. 276.92/204.57 [2019-03-28 12:40:26,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 209 transitions. Stem has 47 letters. Loop has 23 letters. 276.92/204.57 [2019-03-28 12:40:26,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. 276.92/204.57 [2019-03-28 12:40:26,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 209 transitions. Stem has 24 letters. Loop has 46 letters. 276.92/204.57 [2019-03-28 12:40:26,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. 276.92/204.57 [2019-03-28 12:40:26,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2472 states and 2796 transitions. 276.92/204.57 [2019-03-28 12:40:26,104 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 78 276.92/204.57 [2019-03-28 12:40:26,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2472 states to 188 states and 219 transitions. 276.92/204.57 [2019-03-28 12:40:26,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 276.92/204.57 [2019-03-28 12:40:26,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 276.92/204.57 [2019-03-28 12:40:26,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 188 states and 219 transitions. 276.92/204.57 [2019-03-28 12:40:26,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 276.92/204.57 [2019-03-28 12:40:26,106 INFO L706 BuchiCegarLoop]: Abstraction has 188 states and 219 transitions. 276.92/204.57 [2019-03-28 12:40:26,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states and 219 transitions. 276.92/204.57 [2019-03-28 12:40:26,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 66. 276.92/204.57 [2019-03-28 12:40:26,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. 276.92/204.57 [2019-03-28 12:40:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. 276.92/204.57 [2019-03-28 12:40:26,109 INFO L729 BuchiCegarLoop]: Abstraction has 66 states and 77 transitions. 276.92/204.57 [2019-03-28 12:40:26,109 INFO L609 BuchiCegarLoop]: Abstraction has 66 states and 77 transitions. 276.92/204.57 [2019-03-28 12:40:26,109 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ 276.92/204.57 [2019-03-28 12:40:26,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 77 transitions. 276.92/204.57 [2019-03-28 12:40:26,109 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 276.92/204.57 [2019-03-28 12:40:26,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 276.92/204.57 [2019-03-28 12:40:26,110 INFO L119 BuchiIsEmpty]: Starting construction of run 276.92/204.57 [2019-03-28 12:40:26,110 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 276.92/204.57 [2019-03-28 12:40:26,110 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 276.92/204.57 [2019-03-28 12:40:26,111 INFO L794 eck$LassoCheckResult]: Stem: 35691#ULTIMATE.startENTRY [121] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 35689#L-1 [185] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~id~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~maxId~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~id~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_main_~maxId~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_1, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_1|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~maxId~0.base, ULTIMATE.start_main_~tmp~0.offset, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~tmp~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~id~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~maxId~0.offset, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~id~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 35684#L8 [255] L8-->L9: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_14) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19) v_ULTIMATE.start_main_~id~0.offset_14 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_20|) (<= (+ v_ULTIMATE.start_main_~id~0.offset_14 4) (select |v_#length_34| v_ULTIMATE.start_main_~id~0.base_19)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~id~0.base_19))) InVars {ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 35685#L9 [256] L9-->L11: Formula: (and (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~maxId~0.base_13)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_10) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_10 4) (select |v_#length_35| v_ULTIMATE.start_main_~maxId~0.base_13)) (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13) v_ULTIMATE.start_main_~maxId~0.offset_10 |v_ULTIMATE.start_main_#t~nondet3_5|)))) InVars {ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 35687#L11 [122] L11-->L11-1: Formula: (and (= (select |v_#valid_10| v_ULTIMATE.start_main_~id~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~id~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~id~0.base_7) v_ULTIMATE.start_main_~id~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~id~0.base_7))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #valid=|v_#valid_10|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 35690#L11-1 [200] L11-1-->L11-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 35688#L11-2 [100] L11-2-->L11-3: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 35686#L11-3 [97] L11-3-->L11-4: Formula: (and (= (select |v_#valid_12| v_ULTIMATE.start_main_~id~0.base_10) 1) (<= (+ v_ULTIMATE.start_main_~id~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~id~0.base_10)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~id~0.base_10) v_ULTIMATE.start_main_~id~0.offset_8))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #valid=|v_#valid_12|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 35681#L11-4 [91] L11-4-->L11-5: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~maxId~0.base_7) v_ULTIMATE.start_main_~maxId~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_6 4) (select |v_#length_12| v_ULTIMATE.start_main_~maxId~0.base_7)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_6) (= 1 (select |v_#valid_14| v_ULTIMATE.start_main_~maxId~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 35676#L11-5 [216] L11-5-->L11-7: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< |v_ULTIMATE.start_main_#t~mem5_3| |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 35677#L11-7 [205] L11-7-->L13: Formula: (and (= |v_#valid_16| (store |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1)) |v_ULTIMATE.start_main_#t~short7_7| (= 0 (select |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2|)) (= v_ULTIMATE.start_main_~tmp~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (= (store |v_#length_15| |v_ULTIMATE.start_main_#t~malloc8.base_2| 4) |v_#length_14|) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_2|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (= v_ULTIMATE.start_main_~tmp~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_15|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_7|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_2, #valid=|v_#valid_16|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #length=|v_#length_14|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_6|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_~tmp~0.base, ULTIMATE.start_main_~tmp~0.offset, #valid, ULTIMATE.start_main_#t~malloc8.offset, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4] 35698#L13 [146] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~id~0.offset_10 4) (select |v_#length_16| v_ULTIMATE.start_main_~id~0.base_13)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_10) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~id~0.base_13) v_ULTIMATE.start_main_~id~0.offset_10)) (= (select |v_#valid_18| v_ULTIMATE.start_main_~id~0.base_13) 1)) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #valid=|v_#valid_18|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 35694#L13-1 [259] L13-1-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_15) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_15 4) (select |v_#length_36| v_ULTIMATE.start_main_~tmp~0.base_21)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21) v_ULTIMATE.start_main_~tmp~0.offset_15 (+ |v_ULTIMATE.start_main_#t~mem9_6| 1))) |v_#memory_int_24|) (= (select |v_#valid_47| v_ULTIMATE.start_main_~tmp~0.base_21) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_36|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 35695#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 35717#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 35716#L14-2 [233] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 35714#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 35712#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 35706#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 35707#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 35705#L16-1 [260] L16-1-->L18-1: Formula: (and (= (select |v_#valid_48| v_ULTIMATE.start_main_~tmp~0.base_22) 1) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~tmp~0.base_22)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_16) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22) v_ULTIMATE.start_main_~tmp~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_26|)) InVars {ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 35704#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 35703#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 35702#L14-2 [231] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|) (> |v_ULTIMATE.start_main_#t~nondet12_5| 0)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 35701#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 35667#L15-1 276.92/204.57 [2019-03-28 12:40:26,112 INFO L796 eck$LassoCheckResult]: Loop: 35667#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 35696#L15-2 [176] L15-2-->L18: Formula: (> |v_ULTIMATE.start_main_#t~mem13_6| |v_ULTIMATE.start_main_#t~mem14_6|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_6|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_5|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 35682#L18 [94] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_13) (= 1 (select |v_#valid_34| v_ULTIMATE.start_main_~tmp~0.base_18)) (= (store |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18 (store (select |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18) v_ULTIMATE.start_main_~tmp~0.offset_13 0)) |v_#memory_int_18|) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_main_~tmp~0.base_18))) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} OutVars{#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} AuxVars[] AssignedVars[#memory_int] 35678#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 35679#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 35692#L14-2 [232] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (> |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 35666#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 35667#L15-1 276.92/204.57 [2019-03-28 12:40:26,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.92/204.57 [2019-03-28 12:40:26,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2047764872, now seen corresponding path program 1 times 276.92/204.57 [2019-03-28 12:40:26,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.92/204.57 [2019-03-28 12:40:26,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.92/204.57 [2019-03-28 12:40:26,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:26,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:26,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.57 [2019-03-28 12:40:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.57 [2019-03-28 12:40:26,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.92/204.57 [2019-03-28 12:40:26,129 INFO L82 PathProgramCache]: Analyzing trace with hash 212470505, now seen corresponding path program 1 times 276.92/204.57 [2019-03-28 12:40:26,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.92/204.57 [2019-03-28 12:40:26,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.92/204.57 [2019-03-28 12:40:26,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:26,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:26,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.57 [2019-03-28 12:40:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.57 [2019-03-28 12:40:26,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.92/204.57 [2019-03-28 12:40:26,135 INFO L82 PathProgramCache]: Analyzing trace with hash -368956542, now seen corresponding path program 1 times 276.92/204.57 [2019-03-28 12:40:26,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.92/204.57 [2019-03-28 12:40:26,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.92/204.57 [2019-03-28 12:40:26,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:26,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:26,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.57 [2019-03-28 12:40:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.57 [2019-03-28 12:40:27,027 WARN L188 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 135 276.92/204.57 [2019-03-28 12:40:27,176 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 83 276.92/204.57 [2019-03-28 12:40:27,180 INFO L216 LassoAnalysis]: Preferences: 276.92/204.57 [2019-03-28 12:40:27,180 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 276.92/204.57 [2019-03-28 12:40:27,180 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 276.92/204.57 [2019-03-28 12:40:27,180 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 276.92/204.57 [2019-03-28 12:40:27,180 INFO L127 ssoRankerPreferences]: Use exernal solver: false 276.92/204.57 [2019-03-28 12:40:27,180 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 276.92/204.57 [2019-03-28 12:40:27,180 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 276.92/204.57 [2019-03-28 12:40:27,180 INFO L130 ssoRankerPreferences]: Path of dumped script: 276.92/204.57 [2019-03-28 12:40:27,181 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration17_Lasso 276.92/204.57 [2019-03-28 12:40:27,181 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 276.92/204.57 [2019-03-28 12:40:27,181 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 276.92/204.57 [2019-03-28 12:40:27,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:40:27,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:40:27,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:40:27,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:40:27,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:40:27,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:40:27,451 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 276.92/204.57 [2019-03-28 12:40:27,565 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 276.92/204.57 [2019-03-28 12:40:27,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:40:27,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:40:27,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:40:27,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:40:27,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:40:27,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:40:27,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:40:27,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:40:27,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:40:27,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:40:27,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 276.92/204.57 [2019-03-28 12:40:27,994 INFO L300 LassoAnalysis]: Preprocessing complete. 276.92/204.57 [2019-03-28 12:40:27,994 INFO L497 LassoAnalysis]: Using template 'affine'. 276.92/204.57 [2019-03-28 12:40:27,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:40:27,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:40:27,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.57 [2019-03-28 12:40:27,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:40:27,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:40:27,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:40:27,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:40:27,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.57 [2019-03-28 12:40:27,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:40:27,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:40:27,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:40:27,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:40:27,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:40:27,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:40:27,997 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:40:27,997 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.57 [2019-03-28 12:40:27,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:40:27,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:40:27,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:40:27,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:40:27,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:40:27,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:40:28,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:40:28,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.57 [2019-03-28 12:40:28,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:40:28,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:40:28,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:40:28,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 276.92/204.57 [2019-03-28 12:40:28,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:40:28,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:40:28,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:40:28,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:40:28,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 276.92/204.57 [2019-03-28 12:40:28,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:40:28,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:40:28,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:40:28,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:40:28,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:40:28,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:40:28,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:40:28,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.57 [2019-03-28 12:40:28,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:40:28,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:40:28,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:40:28,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:40:28,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:40:28,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:40:28,007 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:40:28,007 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.57 [2019-03-28 12:40:28,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:40:28,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:40:28,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:40:28,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:40:28,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:40:28,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:40:28,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:40:28,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.57 [2019-03-28 12:40:28,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:40:28,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:40:28,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:40:28,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:40:28,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:40:28,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:40:28,016 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:40:28,016 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.57 [2019-03-28 12:40:28,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:40:28,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:40:28,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:40:28,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:40:28,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:40:28,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:40:28,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:40:28,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.57 [2019-03-28 12:40:28,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:40:28,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:40:28,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:40:28,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:40:28,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:40:28,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:40:28,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:40:28,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.57 [2019-03-28 12:40:28,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:40:28,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:40:28,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:40:28,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:40:28,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:40:28,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:40:28,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:40:28,034 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.57 [2019-03-28 12:40:28,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:40:28,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:40:28,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:40:28,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:40:28,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:40:28,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:40:28,038 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:40:28,038 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.57 [2019-03-28 12:40:28,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 276.92/204.57 [2019-03-28 12:40:28,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 276.92/204.57 Termination analysis: LINEAR_WITH_GUESSES 276.92/204.57 Number of strict supporting invariants: 0 276.92/204.57 Number of non-strict supporting invariants: 1 276.92/204.57 Consider only non-deceasing supporting invariants: true 276.92/204.57 Simplify termination arguments: true 276.92/204.57 Simplify supporting invariants: trueOverapproximate stem: false 276.92/204.57 [2019-03-28 12:40:28,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. 276.92/204.57 [2019-03-28 12:40:28,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 276.92/204.57 [2019-03-28 12:40:28,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 276.92/204.57 [2019-03-28 12:40:28,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 276.92/204.57 [2019-03-28 12:40:28,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 276.92/204.57 [2019-03-28 12:40:28,043 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 276.92/204.57 [2019-03-28 12:40:28,078 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 276.92/204.57 [2019-03-28 12:40:28,084 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 276.92/204.57 [2019-03-28 12:40:28,084 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. 276.92/204.57 [2019-03-28 12:40:28,085 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 276.92/204.57 [2019-03-28 12:40:28,085 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 276.92/204.57 [2019-03-28 12:40:28,086 INFO L518 LassoAnalysis]: Proved termination. 276.92/204.57 [2019-03-28 12:40:28,086 INFO L520 LassoAnalysis]: Termination argument consisting of: 276.92/204.57 Ranking function f(ULTIMATE.start_main_#t~mem13, v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0.base) ULTIMATE.start_main_~maxId~0.offset)_7) = 1*ULTIMATE.start_main_#t~mem13 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0.base) ULTIMATE.start_main_~maxId~0.offset)_7 276.92/204.57 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0.base) ULTIMATE.start_main_~maxId~0.offset)_7 >= 0] 276.92/204.57 [2019-03-28 12:40:28,170 INFO L297 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed 276.92/204.57 [2019-03-28 12:40:28,173 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 276.92/204.57 [2019-03-28 12:40:28,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.92/204.57 [2019-03-28 12:40:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:40:28,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 16 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:40:28,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:40:28,296 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:40:28,297 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 276.92/204.57 [2019-03-28 12:40:28,297 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:40:28,302 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:40:28,302 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:40:28,303 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 276.92/204.57 [2019-03-28 12:40:28,358 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:40:28,358 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 49 276.92/204.57 [2019-03-28 12:40:28,359 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:40:28,399 INFO L497 ElimStorePlain]: treesize reduction 18, result has 69.5 percent of original size 276.92/204.57 [2019-03-28 12:40:28,400 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 276.92/204.57 [2019-03-28 12:40:28,400 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:35 276.92/204.57 [2019-03-28 12:40:28,514 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 276.92/204.57 [2019-03-28 12:40:28,514 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:40:28,521 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:40:28,521 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:40:28,522 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:9 276.92/204.57 [2019-03-28 12:40:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:40:28,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:40:28,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:40:28,597 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:40:28,598 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 42 276.92/204.57 [2019-03-28 12:40:28,598 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:40:28,612 INFO L497 ElimStorePlain]: treesize reduction 24, result has 42.9 percent of original size 276.92/204.57 [2019-03-28 12:40:28,612 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:40:28,613 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 276.92/204.57 [2019-03-28 12:40:28,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 276.92/204.57 [2019-03-28 12:40:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:40:28,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:40:28,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:40:28,948 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:40:28,948 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 42 276.92/204.57 [2019-03-28 12:40:28,949 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:40:28,960 INFO L497 ElimStorePlain]: treesize reduction 24, result has 38.5 percent of original size 276.92/204.57 [2019-03-28 12:40:28,960 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:40:28,960 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 276.92/204.57 [2019-03-28 12:40:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.57 [2019-03-28 12:40:29,137 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 276.92/204.57 [2019-03-28 12:40:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.57 [2019-03-28 12:40:29,144 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 276.92/204.57 [2019-03-28 12:40:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.57 [2019-03-28 12:40:29,151 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 276.92/204.57 [2019-03-28 12:40:29,151 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 6 predicates after loop cannibalization 276.92/204.57 [2019-03-28 12:40:29,151 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.11 stem predicates 6 loop predicates 276.92/204.57 [2019-03-28 12:40:29,151 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 66 states and 77 transitions. cyclomatic complexity: 14 Second operand 15 states. 276.92/204.57 [2019-03-28 12:40:35,458 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 66 states and 77 transitions. cyclomatic complexity: 14. Second operand 15 states. Result 148 states and 167 transitions. Complement of second has 39 states. 276.92/204.57 [2019-03-28 12:40:35,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 27 states 16 stem states 7 non-accepting loop states 3 accepting loop states 276.92/204.57 [2019-03-28 12:40:35,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. 276.92/204.57 [2019-03-28 12:40:35,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 70 transitions. 276.92/204.57 [2019-03-28 12:40:35,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 70 transitions. Stem has 25 letters. Loop has 7 letters. 276.92/204.57 [2019-03-28 12:40:35,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. 276.92/204.57 [2019-03-28 12:40:35,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 70 transitions. Stem has 32 letters. Loop has 7 letters. 276.92/204.57 [2019-03-28 12:40:35,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. 276.92/204.57 [2019-03-28 12:40:35,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 70 transitions. Stem has 25 letters. Loop has 14 letters. 276.92/204.57 [2019-03-28 12:40:35,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. 276.92/204.57 [2019-03-28 12:40:35,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 167 transitions. 276.92/204.57 [2019-03-28 12:40:35,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 276.92/204.57 [2019-03-28 12:40:35,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 70 states and 81 transitions. 276.92/204.57 [2019-03-28 12:40:35,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 276.92/204.57 [2019-03-28 12:40:35,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 276.92/204.57 [2019-03-28 12:40:35,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 81 transitions. 276.92/204.57 [2019-03-28 12:40:35,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 276.92/204.57 [2019-03-28 12:40:35,467 INFO L706 BuchiCegarLoop]: Abstraction has 70 states and 81 transitions. 276.92/204.57 [2019-03-28 12:40:35,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 81 transitions. 276.92/204.57 [2019-03-28 12:40:35,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. 276.92/204.57 [2019-03-28 12:40:35,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. 276.92/204.57 [2019-03-28 12:40:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. 276.92/204.57 [2019-03-28 12:40:35,469 INFO L729 BuchiCegarLoop]: Abstraction has 59 states and 68 transitions. 276.92/204.57 [2019-03-28 12:40:35,469 INFO L609 BuchiCegarLoop]: Abstraction has 59 states and 68 transitions. 276.92/204.57 [2019-03-28 12:40:35,469 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ 276.92/204.57 [2019-03-28 12:40:35,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 68 transitions. 276.92/204.57 [2019-03-28 12:40:35,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 276.92/204.57 [2019-03-28 12:40:35,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 276.92/204.57 [2019-03-28 12:40:35,469 INFO L119 BuchiIsEmpty]: Starting construction of run 276.92/204.57 [2019-03-28 12:40:35,470 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 276.92/204.57 [2019-03-28 12:40:35,470 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] 276.92/204.57 [2019-03-28 12:40:35,471 INFO L794 eck$LassoCheckResult]: Stem: 36257#ULTIMATE.startENTRY [121] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 36255#L-1 [185] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~id~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~maxId~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~id~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_main_~maxId~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_1, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_1|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~maxId~0.base, ULTIMATE.start_main_~tmp~0.offset, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~tmp~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~id~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~maxId~0.offset, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~id~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 36250#L8 [255] L8-->L9: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_14) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19) v_ULTIMATE.start_main_~id~0.offset_14 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_20|) (<= (+ v_ULTIMATE.start_main_~id~0.offset_14 4) (select |v_#length_34| v_ULTIMATE.start_main_~id~0.base_19)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~id~0.base_19))) InVars {ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 36251#L9 [256] L9-->L11: Formula: (and (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~maxId~0.base_13)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_10) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_10 4) (select |v_#length_35| v_ULTIMATE.start_main_~maxId~0.base_13)) (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13) v_ULTIMATE.start_main_~maxId~0.offset_10 |v_ULTIMATE.start_main_#t~nondet3_5|)))) InVars {ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 36253#L11 [122] L11-->L11-1: Formula: (and (= (select |v_#valid_10| v_ULTIMATE.start_main_~id~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~id~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~id~0.base_7) v_ULTIMATE.start_main_~id~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~id~0.base_7))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #valid=|v_#valid_10|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 36256#L11-1 [200] L11-1-->L11-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 36254#L11-2 [100] L11-2-->L11-3: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 36252#L11-3 [97] L11-3-->L11-4: Formula: (and (= (select |v_#valid_12| v_ULTIMATE.start_main_~id~0.base_10) 1) (<= (+ v_ULTIMATE.start_main_~id~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~id~0.base_10)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~id~0.base_10) v_ULTIMATE.start_main_~id~0.offset_8))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #valid=|v_#valid_12|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 36246#L11-4 [91] L11-4-->L11-5: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~maxId~0.base_7) v_ULTIMATE.start_main_~maxId~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_6 4) (select |v_#length_12| v_ULTIMATE.start_main_~maxId~0.base_7)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_6) (= 1 (select |v_#valid_14| v_ULTIMATE.start_main_~maxId~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 36241#L11-5 [216] L11-5-->L11-7: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< |v_ULTIMATE.start_main_#t~mem5_3| |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 36242#L11-7 [205] L11-7-->L13: Formula: (and (= |v_#valid_16| (store |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1)) |v_ULTIMATE.start_main_#t~short7_7| (= 0 (select |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2|)) (= v_ULTIMATE.start_main_~tmp~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (= (store |v_#length_15| |v_ULTIMATE.start_main_#t~malloc8.base_2| 4) |v_#length_14|) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_2|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (= v_ULTIMATE.start_main_~tmp~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_15|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_7|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_2, #valid=|v_#valid_16|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #length=|v_#length_14|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_6|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_~tmp~0.base, ULTIMATE.start_main_~tmp~0.offset, #valid, ULTIMATE.start_main_#t~malloc8.offset, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4] 36262#L13 [146] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~id~0.offset_10 4) (select |v_#length_16| v_ULTIMATE.start_main_~id~0.base_13)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_10) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~id~0.base_13) v_ULTIMATE.start_main_~id~0.offset_10)) (= (select |v_#valid_18| v_ULTIMATE.start_main_~id~0.base_13) 1)) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #valid=|v_#valid_18|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 36260#L13-1 [259] L13-1-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_15) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_15 4) (select |v_#length_36| v_ULTIMATE.start_main_~tmp~0.base_21)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21) v_ULTIMATE.start_main_~tmp~0.offset_15 (+ |v_ULTIMATE.start_main_#t~mem9_6| 1))) |v_#memory_int_24|) (= (select |v_#valid_47| v_ULTIMATE.start_main_~tmp~0.base_21) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_36|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 36243#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 36244#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 36279#L14-2 [233] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 36280#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 36266#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 36263#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 36237#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 36238#L16-1 [260] L16-1-->L18-1: Formula: (and (= (select |v_#valid_48| v_ULTIMATE.start_main_~tmp~0.base_22) 1) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~tmp~0.base_22)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_16) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22) v_ULTIMATE.start_main_~tmp~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_26|)) InVars {ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 36277#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 36275#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 36273#L14-2 [231] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|) (> |v_ULTIMATE.start_main_#t~nondet12_5| 0)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 36271#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 36269#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 36268#L15-2 [176] L15-2-->L18: Formula: (> |v_ULTIMATE.start_main_#t~mem13_6| |v_ULTIMATE.start_main_#t~mem14_6|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_6|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_5|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 36249#L18 [94] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_13) (= 1 (select |v_#valid_34| v_ULTIMATE.start_main_~tmp~0.base_18)) (= (store |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18 (store (select |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18) v_ULTIMATE.start_main_~tmp~0.offset_13 0)) |v_#memory_int_18|) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_main_~tmp~0.base_18))) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} OutVars{#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} AuxVars[] AssignedVars[#memory_int] 36232#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 36245#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 36259#L14-2 [234] L14-2-->L15: Formula: (and (> |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|) (> |v_ULTIMATE.start_main_#t~nondet12_5| 0)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 36235#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 36236#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 36264#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 36265#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 36229#L16-1 276.92/204.57 [2019-03-28 12:40:35,472 INFO L796 eck$LassoCheckResult]: Loop: 36229#L16-1 [260] L16-1-->L18-1: Formula: (and (= (select |v_#valid_48| v_ULTIMATE.start_main_~tmp~0.base_22) 1) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~tmp~0.base_22)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_16) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22) v_ULTIMATE.start_main_~tmp~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_26|)) InVars {ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 36230#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 36276#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 36274#L14-2 [232] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (> |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 36272#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 36270#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 36267#L15-2 [176] L15-2-->L18: Formula: (> |v_ULTIMATE.start_main_#t~mem13_6| |v_ULTIMATE.start_main_#t~mem14_6|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_6|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_5|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 36247#L18 [94] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_13) (= 1 (select |v_#valid_34| v_ULTIMATE.start_main_~tmp~0.base_18)) (= (store |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18 (store (select |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18) v_ULTIMATE.start_main_~tmp~0.offset_13 0)) |v_#memory_int_18|) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_main_~tmp~0.base_18))) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} OutVars{#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} AuxVars[] AssignedVars[#memory_int] 36248#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 36261#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 36258#L14-2 [232] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (> |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 36233#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 36234#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 36281#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 36278#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 36229#L16-1 276.92/204.57 [2019-03-28 12:40:35,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.92/204.57 [2019-03-28 12:40:35,472 INFO L82 PathProgramCache]: Analyzing trace with hash -761058168, now seen corresponding path program 1 times 276.92/204.57 [2019-03-28 12:40:35,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.92/204.57 [2019-03-28 12:40:35,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.92/204.57 [2019-03-28 12:40:35,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:35,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:35,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.57 [2019-03-28 12:40:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.57 [2019-03-28 12:40:35,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.92/204.57 [2019-03-28 12:40:35,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1451520445, now seen corresponding path program 8 times 276.92/204.57 [2019-03-28 12:40:35,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.92/204.57 [2019-03-28 12:40:35,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.92/204.57 [2019-03-28 12:40:35,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:35,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:35,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.57 [2019-03-28 12:40:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.57 [2019-03-28 12:40:35,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.92/204.57 [2019-03-28 12:40:35,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1886402986, now seen corresponding path program 1 times 276.92/204.57 [2019-03-28 12:40:35,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.92/204.57 [2019-03-28 12:40:35,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.92/204.57 [2019-03-28 12:40:35,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:35,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:35,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:40:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 33 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. 276.92/204.57 [2019-03-28 12:40:35,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 276.92/204.57 [2019-03-28 12:40:35,862 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 276.92/204.57 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 276.92/204.57 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 276.92/204.57 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 276.92/204.57 [2019-03-28 12:40:35,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:40:35,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 25 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:40:35,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:40:35,920 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:40:35,920 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 276.92/204.57 [2019-03-28 12:40:35,920 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:40:35,929 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:40:35,930 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:40:35,930 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 276.92/204.57 [2019-03-28 12:40:36,148 INFO L189 IndexEqualityManager]: detected not equals via solver 276.92/204.57 [2019-03-28 12:40:36,155 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:40:36,155 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 44 276.92/204.57 [2019-03-28 12:40:36,156 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:40:36,174 INFO L497 ElimStorePlain]: treesize reduction 20, result has 62.3 percent of original size 276.92/204.57 [2019-03-28 12:40:36,174 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:40:36,175 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:24 276.92/204.57 [2019-03-28 12:40:36,211 INFO L189 IndexEqualityManager]: detected not equals via solver 276.92/204.57 [2019-03-28 12:40:36,216 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:40:36,217 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 39 276.92/204.57 [2019-03-28 12:40:36,217 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:40:36,234 INFO L497 ElimStorePlain]: treesize reduction 20, result has 60.8 percent of original size 276.92/204.57 [2019-03-28 12:40:36,234 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:40:36,234 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 276.92/204.57 [2019-03-28 12:40:36,274 INFO L189 IndexEqualityManager]: detected not equals via solver 276.92/204.57 [2019-03-28 12:40:36,281 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:40:36,281 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 44 276.92/204.57 [2019-03-28 12:40:36,282 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:40:36,300 INFO L497 ElimStorePlain]: treesize reduction 20, result has 62.3 percent of original size 276.92/204.57 [2019-03-28 12:40:36,301 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:40:36,301 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:24 276.92/204.57 [2019-03-28 12:40:36,518 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 37 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 276.92/204.57 [2019-03-28 12:40:36,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 276.92/204.57 [2019-03-28 12:40:36,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 30 276.92/204.57 [2019-03-28 12:40:36,734 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 276.92/204.57 [2019-03-28 12:40:36,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. 276.92/204.57 [2019-03-28 12:40:36,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=746, Unknown=0, NotChecked=0, Total=870 276.92/204.57 [2019-03-28 12:40:36,783 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. cyclomatic complexity: 11 Second operand 30 states. 276.92/204.57 [2019-03-28 12:40:38,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 276.92/204.57 [2019-03-28 12:40:38,225 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. 276.92/204.57 [2019-03-28 12:40:38,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 276.92/204.57 [2019-03-28 12:40:38,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 133 transitions. 276.92/204.57 [2019-03-28 12:40:38,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 276.92/204.57 [2019-03-28 12:40:38,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 59 states and 67 transitions. 276.92/204.57 [2019-03-28 12:40:38,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 276.92/204.57 [2019-03-28 12:40:38,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 276.92/204.57 [2019-03-28 12:40:38,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 67 transitions. 276.92/204.57 [2019-03-28 12:40:38,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 276.92/204.57 [2019-03-28 12:40:38,231 INFO L706 BuchiCegarLoop]: Abstraction has 59 states and 67 transitions. 276.92/204.57 [2019-03-28 12:40:38,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 67 transitions. 276.92/204.57 [2019-03-28 12:40:38,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. 276.92/204.57 [2019-03-28 12:40:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. 276.92/204.57 [2019-03-28 12:40:38,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. 276.92/204.57 [2019-03-28 12:40:38,232 INFO L729 BuchiCegarLoop]: Abstraction has 59 states and 67 transitions. 276.92/204.57 [2019-03-28 12:40:38,232 INFO L609 BuchiCegarLoop]: Abstraction has 59 states and 67 transitions. 276.92/204.57 [2019-03-28 12:40:38,233 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ 276.92/204.57 [2019-03-28 12:40:38,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 67 transitions. 276.92/204.57 [2019-03-28 12:40:38,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 276.92/204.57 [2019-03-28 12:40:38,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 276.92/204.57 [2019-03-28 12:40:38,233 INFO L119 BuchiIsEmpty]: Starting construction of run 276.92/204.57 [2019-03-28 12:40:38,234 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 276.92/204.57 [2019-03-28 12:40:38,234 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] 276.92/204.57 [2019-03-28 12:40:38,235 INFO L794 eck$LassoCheckResult]: Stem: 36658#ULTIMATE.startENTRY [121] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 36656#L-1 [183] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~id~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~maxId~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~id~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~maxId~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_1, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_1|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~maxId~0.base, ULTIMATE.start_main_~tmp~0.offset, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~tmp~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~id~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~maxId~0.offset, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~id~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 36652#L8 [255] L8-->L9: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_14) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19) v_ULTIMATE.start_main_~id~0.offset_14 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_20|) (<= (+ v_ULTIMATE.start_main_~id~0.offset_14 4) (select |v_#length_34| v_ULTIMATE.start_main_~id~0.base_19)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~id~0.base_19))) InVars {ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 36653#L9 [256] L9-->L11: Formula: (and (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~maxId~0.base_13)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_10) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_10 4) (select |v_#length_35| v_ULTIMATE.start_main_~maxId~0.base_13)) (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13) v_ULTIMATE.start_main_~maxId~0.offset_10 |v_ULTIMATE.start_main_#t~nondet3_5|)))) InVars {ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 36655#L11 [122] L11-->L11-1: Formula: (and (= (select |v_#valid_10| v_ULTIMATE.start_main_~id~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~id~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~id~0.base_7) v_ULTIMATE.start_main_~id~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~id~0.base_7))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #valid=|v_#valid_10|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 36657#L11-1 [200] L11-1-->L11-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 36654#L11-2 [100] L11-2-->L11-3: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 36651#L11-3 [97] L11-3-->L11-4: Formula: (and (= (select |v_#valid_12| v_ULTIMATE.start_main_~id~0.base_10) 1) (<= (+ v_ULTIMATE.start_main_~id~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~id~0.base_10)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~id~0.base_10) v_ULTIMATE.start_main_~id~0.offset_8))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_10, #valid=|v_#valid_12|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 36647#L11-4 [91] L11-4-->L11-5: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~maxId~0.base_7) v_ULTIMATE.start_main_~maxId~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_6 4) (select |v_#length_12| v_ULTIMATE.start_main_~maxId~0.base_7)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_6) (= 1 (select |v_#valid_14| v_ULTIMATE.start_main_~maxId~0.base_7))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_7, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_6, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 36642#L11-5 [216] L11-5-->L11-7: Formula: (and |v_ULTIMATE.start_main_#t~short7_4| (< |v_ULTIMATE.start_main_#t~mem5_3| |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 36643#L11-7 [205] L11-7-->L13: Formula: (and (= |v_#valid_16| (store |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1)) |v_ULTIMATE.start_main_#t~short7_7| (= 0 (select |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2|)) (= v_ULTIMATE.start_main_~tmp~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (= (store |v_#length_15| |v_ULTIMATE.start_main_#t~malloc8.base_2| 4) |v_#length_14|) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_2|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (= v_ULTIMATE.start_main_~tmp~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_15|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_7|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_2, #valid=|v_#valid_16|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #length=|v_#length_14|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_6|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_~tmp~0.base, ULTIMATE.start_main_~tmp~0.offset, #valid, ULTIMATE.start_main_#t~malloc8.offset, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4] 36667#L13 [146] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~id~0.offset_10 4) (select |v_#length_16| v_ULTIMATE.start_main_~id~0.base_13)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_10) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~id~0.base_13) v_ULTIMATE.start_main_~id~0.offset_10)) (= (select |v_#valid_18| v_ULTIMATE.start_main_~id~0.base_13) 1)) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #valid=|v_#valid_18|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 36659#L13-1 [259] L13-1-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_15) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_15 4) (select |v_#length_36| v_ULTIMATE.start_main_~tmp~0.base_21)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21) v_ULTIMATE.start_main_~tmp~0.offset_15 (+ |v_ULTIMATE.start_main_#t~mem9_6| 1))) |v_#memory_int_24|) (= (select |v_#valid_47| v_ULTIMATE.start_main_~tmp~0.base_21) 1)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_36|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 36660#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 36689#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 36661#L14-2 [233] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 36662#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 36685#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 36683#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 36681#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 36680#L16-1 [260] L16-1-->L18-1: Formula: (and (= (select |v_#valid_48| v_ULTIMATE.start_main_~tmp~0.base_22) 1) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~tmp~0.base_22)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_16) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22) v_ULTIMATE.start_main_~tmp~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_26|)) InVars {ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 36679#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 36677#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 36675#L14-2 [231] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|) (> |v_ULTIMATE.start_main_#t~nondet12_5| 0)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 36673#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 36671#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 36670#L15-2 [176] L15-2-->L18: Formula: (> |v_ULTIMATE.start_main_#t~mem13_6| |v_ULTIMATE.start_main_#t~mem14_6|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_6|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_5|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 36649#L18 [94] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_13) (= 1 (select |v_#valid_34| v_ULTIMATE.start_main_~tmp~0.base_18)) (= (store |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18 (store (select |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18) v_ULTIMATE.start_main_~tmp~0.offset_13 0)) |v_#memory_int_18|) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_main_~tmp~0.base_18))) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} OutVars{#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} AuxVars[] AssignedVars[#memory_int] 36650#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 36688#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 36687#L14-2 [234] L14-2-->L15: Formula: (and (> |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|) (> |v_ULTIMATE.start_main_#t~nondet12_5| 0)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 36686#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 36684#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 36682#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 36641#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 36635#L16-1 276.92/204.57 [2019-03-28 12:40:38,236 INFO L796 eck$LassoCheckResult]: Loop: 36635#L16-1 [260] L16-1-->L18-1: Formula: (and (= (select |v_#valid_48| v_ULTIMATE.start_main_~tmp~0.base_22) 1) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_16 4) (select |v_#length_37| v_ULTIMATE.start_main_~tmp~0.base_22)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_16) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~tmp~0.base_22) v_ULTIMATE.start_main_~tmp~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_26|)) InVars {ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_22, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 36636#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 36678#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 36676#L14-2 [232] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (> |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 36674#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 36672#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 36669#L15-2 [176] L15-2-->L18: Formula: (> |v_ULTIMATE.start_main_#t~mem13_6| |v_ULTIMATE.start_main_#t~mem14_6|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_6|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_5|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 36648#L18 [94] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_13) (= 1 (select |v_#valid_34| v_ULTIMATE.start_main_~tmp~0.base_18)) (= (store |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18 (store (select |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18) v_ULTIMATE.start_main_~tmp~0.offset_13 0)) |v_#memory_int_18|) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_main_~tmp~0.base_18))) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} OutVars{#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} AuxVars[] AssignedVars[#memory_int] 36644#L18-1 [88] L18-1-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 36645#L14-1 [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 36668#L14-2 [232] L14-2-->L15: Formula: (and (< |v_ULTIMATE.start_main_#t~nondet12_5| 0) (> |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 36631#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 36632#L15-1 [128] L15-1-->L15-2: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 36664#L15-2 [126] L15-2-->L16: Formula: (<= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 36639#L16 [134] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~tmp~0.base_12) v_ULTIMATE.start_main_~tmp~0.offset_9)) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_9 4) (select |v_#length_28| v_ULTIMATE.start_main_~tmp~0.base_12)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_9) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~tmp~0.base_12))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, #length=|v_#length_28|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_12, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_9, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_15|, #length=|v_#length_28|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 36635#L16-1 276.92/204.57 [2019-03-28 12:40:38,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.92/204.57 [2019-03-28 12:40:38,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1482925130, now seen corresponding path program 1 times 276.92/204.57 [2019-03-28 12:40:38,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.92/204.57 [2019-03-28 12:40:38,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.92/204.57 [2019-03-28 12:40:38,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:38,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:38,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.57 [2019-03-28 12:40:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.57 [2019-03-28 12:40:38,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.92/204.57 [2019-03-28 12:40:38,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1451520445, now seen corresponding path program 9 times 276.92/204.57 [2019-03-28 12:40:38,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.92/204.57 [2019-03-28 12:40:38,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.92/204.57 [2019-03-28 12:40:38,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:38,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:38,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.57 [2019-03-28 12:40:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 276.92/204.57 [2019-03-28 12:40:38,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 276.92/204.57 [2019-03-28 12:40:38,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1870884268, now seen corresponding path program 1 times 276.92/204.57 [2019-03-28 12:40:38,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 276.92/204.57 [2019-03-28 12:40:38,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 276.92/204.57 [2019-03-28 12:40:38,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:38,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:38,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:40:38,580 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 35 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 276.92/204.57 [2019-03-28 12:40:38,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 276.92/204.57 [2019-03-28 12:40:38,581 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 276.92/204.57 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 276.92/204.57 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 276.92/204.57 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 276.92/204.57 [2019-03-28 12:40:38,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 276.92/204.57 [2019-03-28 12:40:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 276.92/204.57 [2019-03-28 12:40:38,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 24 conjunts are in the unsatisfiable core 276.92/204.57 [2019-03-28 12:40:38,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... 276.92/204.57 [2019-03-28 12:40:38,693 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:40:38,694 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 276.92/204.57 [2019-03-28 12:40:38,694 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:40:38,697 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:40:38,698 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:40:38,698 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:9 276.92/204.57 [2019-03-28 12:40:38,926 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:40:38,926 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 44 276.92/204.57 [2019-03-28 12:40:38,927 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:40:38,942 INFO L497 ElimStorePlain]: treesize reduction 20, result has 60.8 percent of original size 276.92/204.57 [2019-03-28 12:40:38,943 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:40:38,943 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:22 276.92/204.57 [2019-03-28 12:40:38,997 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:40:38,997 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 39 276.92/204.57 [2019-03-28 12:40:38,998 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:40:39,016 INFO L497 ElimStorePlain]: treesize reduction 20, result has 59.2 percent of original size 276.92/204.57 [2019-03-28 12:40:39,016 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:40:39,016 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 276.92/204.57 [2019-03-28 12:40:39,072 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 276.92/204.57 [2019-03-28 12:40:39,072 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 44 276.92/204.57 [2019-03-28 12:40:39,073 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:40:39,091 INFO L497 ElimStorePlain]: treesize reduction 20, result has 60.8 percent of original size 276.92/204.57 [2019-03-28 12:40:39,092 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 276.92/204.57 [2019-03-28 12:40:39,092 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:22 276.92/204.57 [2019-03-28 12:40:39,347 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 37 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 276.92/204.57 [2019-03-28 12:40:39,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 276.92/204.57 [2019-03-28 12:40:39,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 276.92/204.57 [2019-03-28 12:40:39,578 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 276.92/204.57 [2019-03-28 12:40:39,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. 276.92/204.57 [2019-03-28 12:40:39,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=962, Unknown=0, NotChecked=0, Total=1056 276.92/204.57 [2019-03-28 12:40:39,622 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. cyclomatic complexity: 10 Second operand 33 states. 276.92/204.57 [2019-03-28 12:40:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 276.92/204.57 [2019-03-28 12:40:51,860 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. 276.92/204.57 [2019-03-28 12:40:51,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. 276.92/204.57 [2019-03-28 12:40:51,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 84 transitions. 276.92/204.57 [2019-03-28 12:40:51,865 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 276.92/204.57 [2019-03-28 12:40:51,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 0 states and 0 transitions. 276.92/204.57 [2019-03-28 12:40:51,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 276.92/204.57 [2019-03-28 12:40:51,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 276.92/204.57 [2019-03-28 12:40:51,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 276.92/204.57 [2019-03-28 12:40:51,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 276.92/204.57 [2019-03-28 12:40:51,866 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 276.92/204.57 [2019-03-28 12:40:51,866 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 276.92/204.57 [2019-03-28 12:40:51,866 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 276.92/204.57 [2019-03-28 12:40:51,866 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ 276.92/204.57 [2019-03-28 12:40:51,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 276.92/204.57 [2019-03-28 12:40:51,866 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 276.92/204.57 [2019-03-28 12:40:51,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 276.92/204.57 [2019-03-28 12:40:51,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:40:51 BasicIcfg 276.92/204.57 [2019-03-28 12:40:51,873 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 276.92/204.57 [2019-03-28 12:40:51,873 INFO L168 Benchmark]: Toolchain (without parser) took 200274.04 ms. Allocated memory was 649.6 MB in the beginning and 848.3 MB in the end (delta: 198.7 MB). Free memory was 563.8 MB in the beginning and 424.8 MB in the end (delta: 139.0 MB). Peak memory consumption was 337.7 MB. Max. memory is 50.3 GB. 276.92/204.57 [2019-03-28 12:40:51,874 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 591.9 MB. There was no memory consumed. Max. memory is 50.3 GB. 276.92/204.57 [2019-03-28 12:40:51,874 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.66 ms. Allocated memory was 649.6 MB in the beginning and 658.5 MB in the end (delta: 8.9 MB). Free memory was 563.8 MB in the beginning and 626.1 MB in the end (delta: -62.3 MB). Peak memory consumption was 29.9 MB. Max. memory is 50.3 GB. 276.92/204.57 [2019-03-28 12:40:51,874 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.11 ms. Allocated memory is still 658.5 MB. Free memory was 624.8 MB in the beginning and 621.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 50.3 GB. 276.92/204.57 [2019-03-28 12:40:51,875 INFO L168 Benchmark]: Boogie Preprocessor took 25.50 ms. Allocated memory is still 658.5 MB. Free memory was 621.6 MB in the beginning and 620.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 276.92/204.57 [2019-03-28 12:40:51,875 INFO L168 Benchmark]: RCFGBuilder took 374.81 ms. Allocated memory is still 658.5 MB. Free memory was 620.3 MB in the beginning and 592.8 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 50.3 GB. 276.92/204.57 [2019-03-28 12:40:51,875 INFO L168 Benchmark]: BlockEncodingV2 took 134.59 ms. Allocated memory is still 658.5 MB. Free memory was 592.8 MB in the beginning and 582.0 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 276.92/204.57 [2019-03-28 12:40:51,875 INFO L168 Benchmark]: TraceAbstraction took 1667.95 ms. Allocated memory is still 658.5 MB. Free memory was 582.0 MB in the beginning and 389.9 MB in the end (delta: 192.1 MB). Peak memory consumption was 192.1 MB. Max. memory is 50.3 GB. 276.92/204.57 [2019-03-28 12:40:51,876 INFO L168 Benchmark]: BuchiAutomizer took 197714.14 ms. Allocated memory was 658.5 MB in the beginning and 848.3 MB in the end (delta: 189.8 MB). Free memory was 389.9 MB in the beginning and 424.8 MB in the end (delta: -34.9 MB). Peak memory consumption was 154.9 MB. Max. memory is 50.3 GB. 276.92/204.57 [2019-03-28 12:40:51,877 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 276.92/204.57 --- Results --- 276.92/204.57 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 276.92/204.57 - StatisticsResult: Initial Icfg 276.92/204.57 59 locations, 63 edges 276.92/204.57 - StatisticsResult: Encoded RCFG 276.92/204.57 50 locations, 89 edges 276.92/204.57 * Results from de.uni_freiburg.informatik.ultimate.core: 276.92/204.57 - StatisticsResult: Toolchain Benchmarks 276.92/204.57 Benchmark results are: 276.92/204.57 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 591.9 MB. There was no memory consumed. Max. memory is 50.3 GB. 276.92/204.57 * CACSL2BoogieTranslator took 308.66 ms. Allocated memory was 649.6 MB in the beginning and 658.5 MB in the end (delta: 8.9 MB). Free memory was 563.8 MB in the beginning and 626.1 MB in the end (delta: -62.3 MB). Peak memory consumption was 29.9 MB. Max. memory is 50.3 GB. 276.92/204.57 * Boogie Procedure Inliner took 43.11 ms. Allocated memory is still 658.5 MB. Free memory was 624.8 MB in the beginning and 621.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 50.3 GB. 276.92/204.57 * Boogie Preprocessor took 25.50 ms. Allocated memory is still 658.5 MB. Free memory was 621.6 MB in the beginning and 620.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 276.92/204.57 * RCFGBuilder took 374.81 ms. Allocated memory is still 658.5 MB. Free memory was 620.3 MB in the beginning and 592.8 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 50.3 GB. 276.92/204.57 * BlockEncodingV2 took 134.59 ms. Allocated memory is still 658.5 MB. Free memory was 592.8 MB in the beginning and 582.0 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 276.92/204.57 * TraceAbstraction took 1667.95 ms. Allocated memory is still 658.5 MB. Free memory was 582.0 MB in the beginning and 389.9 MB in the end (delta: 192.1 MB). Peak memory consumption was 192.1 MB. Max. memory is 50.3 GB. 276.92/204.57 * BuchiAutomizer took 197714.14 ms. Allocated memory was 658.5 MB in the beginning and 848.3 MB in the end (delta: 189.8 MB). Free memory was 389.9 MB in the beginning and 424.8 MB in the end (delta: -34.9 MB). Peak memory consumption was 154.9 MB. Max. memory is 50.3 GB. 276.92/204.57 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 276.92/204.57 - GenericResult: Unfinished Backtranslation 276.92/204.57 unknown boogie variable #length 276.92/204.57 - GenericResult: Unfinished Backtranslation 276.92/204.57 unknown boogie variable #length 276.92/204.57 - GenericResult: Unfinished Backtranslation 276.92/204.57 unknown boogie variable #length 276.92/204.57 - GenericResult: Unfinished Backtranslation 276.92/204.57 unknown boogie variable #length 276.92/204.57 - GenericResult: Unfinished Backtranslation 276.92/204.57 unknown boogie variable #length 276.92/204.57 - GenericResult: Unfinished Backtranslation 276.92/204.57 unknown boogie variable #length 276.92/204.57 - GenericResult: Unfinished Backtranslation 276.92/204.57 unknown boogie variable #memory_int 276.92/204.57 - GenericResult: Unfinished Backtranslation 276.92/204.57 unknown boogie variable #memory_int 276.92/204.57 - GenericResult: Unfinished Backtranslation 276.92/204.57 unknown boogie variable #memory_int 276.92/204.57 - GenericResult: Unfinished Backtranslation 276.92/204.57 unknown boogie variable #memory_int 276.92/204.57 - GenericResult: Unfinished Backtranslation 276.92/204.57 unknown boogie variable #memory_int 276.92/204.57 - GenericResult: Unfinished Backtranslation 276.92/204.57 unknown boogie variable #memory_int 276.92/204.57 - GenericResult: Unfinished Backtranslation 276.92/204.57 unknown boogie variable #memory_int 276.92/204.57 - GenericResult: Unfinished Backtranslation 276.92/204.57 unknown boogie variable #memory_int 276.92/204.57 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 276.92/204.57 - PositiveResult [Line: 14]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 15]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 15]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 15]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 15]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 16]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 16]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 16]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 16]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 11]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 18]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 11]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 11]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 18]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 11]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 11]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 11]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 9]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 13]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 9]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 13]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 8]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 13]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 8]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 13]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 14]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 14]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - PositiveResult [Line: 14]: pointer dereference always succeeds 276.92/204.57 For all program executions holds that pointer dereference always succeeds at this location 276.92/204.57 - AllSpecificationsHoldResult: All specifications hold 276.92/204.57 28 specifications checked. All of them hold 276.92/204.57 - InvariantResult [Line: 14]: Loop Invariant 276.92/204.57 [2019-03-28 12:40:51,883 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 276.92/204.57 [2019-03-28 12:40:51,883 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 276.92/204.58 [2019-03-28 12:40:51,883 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 276.92/204.58 [2019-03-28 12:40:51,884 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 276.92/204.58 [2019-03-28 12:40:51,884 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 276.92/204.58 [2019-03-28 12:40:51,884 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 276.92/204.58 Derived loop invariant: (((((((0 == maxId && 1 == \valid[maxId]) && 4 == unknown-#length-unknown[maxId]) && id == 0) && \valid[tmp] == 1) && unknown-#length-unknown[id] == 4) && 1 == \valid[id]) && 4 == unknown-#length-unknown[tmp]) && tmp == 0 276.92/204.58 - StatisticsResult: Ultimate Automizer benchmark data 276.92/204.58 CFG has 1 procedures, 50 locations, 28 error locations. SAFE Result, 1.5s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 73 SDtfs, 367 SDslu, 64 SDs, 0 SdLazy, 503 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 997 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 276.92/204.58 - StatisticsResult: Constructed decomposition of program 276.92/204.58 Your program was decomposed into 19 terminating modules (12 trivial, 0 deterministic, 7 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[maxId][maxId] + -1 * unknown-#memory_int-unknown[tmp][tmp] and consists of 19 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[tmp][tmp] and consists of 56 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[tmp][tmp] and consists of 163 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[tmp][tmp] and consists of 96 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[tmp][tmp] and consists of 217 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[tmp][tmp] and consists of 133 locations. One nondeterministic module has affine ranking function aux-tmp-aux + -1 * unknown-#memory_int-unknown[maxId][maxId] and consists of 27 locations. 12 modules have a trivial ranking function, the largest among these consists of 33 locations. 276.92/204.58 - StatisticsResult: Timing statistics 276.92/204.58 BüchiAutomizer plugin needed 197.6s and 20 iterations. TraceHistogramMax:3. Analysis of lassos took 21.9s. Construction of modules took 36.9s. Büchi inclusion checks took 138.3s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 13. Automata minimization 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 3597 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 152 states and ocurred in iteration 15. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 7/44 HoareTripleCheckerStatistics: 183 SDtfs, 3316 SDslu, 1886 SDs, 0 SdLazy, 14447 SolverSat, 2445 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 36.9s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc8 concLT0 SILN0 SILU4 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital387 mio100 ax100 hnf100 lsp96 ukn48 mio100 lsp39 div100 bol100 ite100 ukn100 eq183 hnf88 smp96 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 276.92/204.58 - TerminationAnalysisResult: Termination proven 276.92/204.58 Buchi Automizer proved that your program is terminating 276.92/204.58 RESULT: Ultimate proved your program to be correct! 276.92/204.58 !SESSION 2019-03-28 12:37:28.287 ----------------------------------------------- 276.92/204.58 eclipse.buildId=unknown 276.92/204.58 java.version=1.8.0_181 276.92/204.58 java.vendor=Oracle Corporation 276.92/204.58 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 276.92/204.58 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 276.92/204.58 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 276.92/204.58 276.92/204.58 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:40:52.109 276.92/204.58 !MESSAGE The workspace will exit with unsaved changes in this session. 276.92/204.58 Received shutdown request... 276.92/204.58 Ultimate: 276.92/204.58 GTK+ Version Check 276.92/204.58 EOF