./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/nested9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-invgen/nested9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f3ca1fd1ad8fdbcd9efe7b99bc6e3715231417d253ce4ee9bba3d5969472333a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:46:20,466 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:46:20,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-19 14:46:20,534 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:46:20,536 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:46:20,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:46:20,569 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:46:20,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:46:20,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:46:20,571 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:46:20,573 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:46:20,573 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:46:20,573 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:46:20,574 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:46:20,574 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:46:20,577 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:46:20,577 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:46:20,578 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:46:20,578 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:46:20,578 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:46:20,578 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:46:20,579 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 14:46:20,579 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:46:20,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 14:46:20,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:46:20,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:46:20,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:46:20,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:46:20,581 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:46:20,581 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:46:20,581 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 14:46:20,581 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:46:20,581 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:46:20,582 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:46:20,582 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:46:20,582 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:46:20,582 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:46:20,583 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:46:20,583 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:46:20,584 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f3ca1fd1ad8fdbcd9efe7b99bc6e3715231417d253ce4ee9bba3d5969472333a [2024-11-19 14:46:20,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:46:20,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:46:20,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:46:20,884 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:46:20,884 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:46:20,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/nested9.i [2024-11-19 14:46:22,270 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:46:22,474 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:46:22,475 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/nested9.i [2024-11-19 14:46:22,482 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b062d10a/8ef510d02e3c419bb7633ac1ab9258a9/FLAG6428af077 [2024-11-19 14:46:22,849 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b062d10a/8ef510d02e3c419bb7633ac1ab9258a9 [2024-11-19 14:46:22,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:46:22,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:46:22,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:46:22,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:46:22,858 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:46:22,858 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:46:22" (1/1) ... [2024-11-19 14:46:22,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15447734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:22, skipping insertion in model container [2024-11-19 14:46:22,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:46:22" (1/1) ... [2024-11-19 14:46:22,876 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:46:23,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:46:23,074 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:46:23,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:46:23,114 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:46:23,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:23 WrapperNode [2024-11-19 14:46:23,115 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:46:23,116 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:46:23,116 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:46:23,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:46:23,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:23" (1/1) ... [2024-11-19 14:46:23,130 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:23" (1/1) ... [2024-11-19 14:46:23,146 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2024-11-19 14:46:23,146 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:46:23,147 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:46:23,147 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:46:23,147 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:46:23,156 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:23" (1/1) ... [2024-11-19 14:46:23,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:23" (1/1) ... [2024-11-19 14:46:23,158 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:23" (1/1) ... [2024-11-19 14:46:23,170 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 14:46:23,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:23" (1/1) ... [2024-11-19 14:46:23,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:23" (1/1) ... [2024-11-19 14:46:23,173 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:23" (1/1) ... [2024-11-19 14:46:23,176 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:23" (1/1) ... [2024-11-19 14:46:23,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:23" (1/1) ... [2024-11-19 14:46:23,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:23" (1/1) ... [2024-11-19 14:46:23,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:46:23,181 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:46:23,181 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:46:23,181 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:46:23,182 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:23" (1/1) ... [2024-11-19 14:46:23,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:23,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:23,221 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:23,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-19 14:46:23,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 14:46:23,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 14:46:23,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:46:23,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:46:23,339 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:46:23,341 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:46:23,539 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-19 14:46:23,540 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:46:23,563 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:46:23,563 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 14:46:23,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:46:23 BoogieIcfgContainer [2024-11-19 14:46:23,564 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:46:23,564 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:46:23,564 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:46:23,593 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:46:23,594 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:46:23,598 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:46:22" (1/3) ... [2024-11-19 14:46:23,599 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d9d2f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:46:23, skipping insertion in model container [2024-11-19 14:46:23,599 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:46:23,600 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:23" (2/3) ... [2024-11-19 14:46:23,600 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d9d2f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:46:23, skipping insertion in model container [2024-11-19 14:46:23,600 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:46:23,600 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:46:23" (3/3) ... [2024-11-19 14:46:23,601 INFO L332 chiAutomizerObserver]: Analyzing ICFG nested9.i [2024-11-19 14:46:23,673 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:46:23,673 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:46:23,674 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:46:23,674 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:46:23,674 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:46:23,674 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:46:23,675 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:46:23,675 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:46:23,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:23,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2024-11-19 14:46:23,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:23,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:23,702 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:23,702 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:46:23,702 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:46:23,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:23,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2024-11-19 14:46:23,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:23,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:23,705 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:23,705 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:46:23,711 INFO L745 eck$LassoCheckResult]: Stem: 17#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 4#L30true assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 7#L31true assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 9#L32true assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 6#L33true assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 5#L33-1true main_~i~0#1 := 0; 22#L34-3true [2024-11-19 14:46:23,712 INFO L747 eck$LassoCheckResult]: Loop: 22#L34-3true assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 12#L35-3true assume !(main_~j~0#1 < 3 * main_~i~0#1); 11#L34-2true main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 22#L34-3true [2024-11-19 14:46:23,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:23,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1806907757, now seen corresponding path program 1 times [2024-11-19 14:46:23,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:23,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768068407] [2024-11-19 14:46:23,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:23,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:23,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:23,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:23,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:23,849 INFO L85 PathProgramCache]: Analyzing trace with hash 61796, now seen corresponding path program 1 times [2024-11-19 14:46:23,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:23,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079168436] [2024-11-19 14:46:23,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:23,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:23,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:23,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:23,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:23,867 INFO L85 PathProgramCache]: Analyzing trace with hash 763900024, now seen corresponding path program 1 times [2024-11-19 14:46:23,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:23,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144782685] [2024-11-19 14:46:23,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:23,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:23,883 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:23,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:23,979 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:23,980 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:23,980 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:23,980 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:23,980 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:46:23,981 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:23,981 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:23,981 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:23,981 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration1_Loop [2024-11-19 14:46:23,981 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:23,981 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:23,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:24,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:24,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:24,065 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:24,066 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:46:24,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:24,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:24,083 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:24,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-19 14:46:24,085 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:24,085 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:24,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-19 14:46:24,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:24,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:24,113 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:24,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-19 14:46:24,117 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:46:24,117 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:24,155 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:46:24,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-19 14:46:24,162 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:24,162 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:24,162 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:24,162 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:24,162 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:46:24,162 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:24,162 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:24,163 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:24,163 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration1_Loop [2024-11-19 14:46:24,163 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:24,163 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:24,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:24,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:24,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:24,224 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:24,228 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:46:24,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:24,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:24,232 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:24,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-19 14:46:24,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:24,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:24,249 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:24,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:24,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:24,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:24,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:24,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:24,259 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:46:24,264 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:46:24,264 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:46:24,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:24,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:24,269 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:24,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-19 14:46:24,272 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:46:24,272 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:46:24,272 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:46:24,273 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 1 Supporting invariants [] [2024-11-19 14:46:24,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-19 14:46:24,293 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:46:24,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:24,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:24,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:24,382 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 14:46:24,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:24,467 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-19 14:46:24,469 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:24,573 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 72 states and 105 transitions. Complement of second has 10 states. [2024-11-19 14:46:24,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:24,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:24,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2024-11-19 14:46:24,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 70 transitions. Stem has 7 letters. Loop has 3 letters. [2024-11-19 14:46:24,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:24,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 70 transitions. Stem has 10 letters. Loop has 3 letters. [2024-11-19 14:46:24,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:24,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 70 transitions. Stem has 7 letters. Loop has 6 letters. [2024-11-19 14:46:24,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:24,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 105 transitions. [2024-11-19 14:46:24,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-11-19 14:46:24,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 39 states and 48 transitions. [2024-11-19 14:46:24,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-19 14:46:24,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-11-19 14:46:24,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. [2024-11-19 14:46:24,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:24,605 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-11-19 14:46:24,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. [2024-11-19 14:46:24,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2024-11-19 14:46:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-11-19 14:46:24,631 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-19 14:46:24,631 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-19 14:46:24,631 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:46:24,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2024-11-19 14:46:24,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-19 14:46:24,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:24,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:24,633 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:24,633 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-19 14:46:24,634 INFO L745 eck$LassoCheckResult]: Stem: 178#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 167#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 155#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 156#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 160#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 159#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 157#L33-1 main_~i~0#1 := 0; 158#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 172#L35-3 [2024-11-19 14:46:24,634 INFO L747 eck$LassoCheckResult]: Loop: 172#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 161#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 163#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 179#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 168#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 169#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 172#L35-3 [2024-11-19 14:46:24,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:24,635 INFO L85 PathProgramCache]: Analyzing trace with hash 179565651, now seen corresponding path program 1 times [2024-11-19 14:46:24,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:24,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748694990] [2024-11-19 14:46:24,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:24,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:24,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:24,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:24,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:24,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2077305723, now seen corresponding path program 1 times [2024-11-19 14:46:24,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:24,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088199144] [2024-11-19 14:46:24,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:24,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:24,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:24,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:24,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:24,702 INFO L85 PathProgramCache]: Analyzing trace with hash -696444339, now seen corresponding path program 1 times [2024-11-19 14:46:24,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:24,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252689144] [2024-11-19 14:46:24,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:24,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:24,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:24,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:24,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252689144] [2024-11-19 14:46:24,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252689144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:46:24,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:46:24,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 14:46:24,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496642835] [2024-11-19 14:46:24,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:46:24,910 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:24,910 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:24,910 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:24,910 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:24,911 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:46:24,911 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:24,911 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:24,911 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:24,911 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration2_Loop [2024-11-19 14:46:24,911 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:24,911 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:24,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:24,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:24,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:24,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:24,979 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:24,979 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:46:24,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:24,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:24,981 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:24,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-19 14:46:24,984 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:24,984 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:25,001 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:25,001 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6#1=0} Honda state: {ULTIMATE.start_main_#t~post6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:25,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:25,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:25,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:25,017 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:25,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-19 14:46:25,019 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:25,019 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:25,032 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:25,032 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0#1=0} Honda state: {ULTIMATE.start_main_~k~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:25,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-19 14:46:25,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:25,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:25,045 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:25,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-19 14:46:25,047 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:25,047 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:25,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-19 14:46:25,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:25,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:25,076 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:25,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-19 14:46:25,088 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:46:25,088 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:25,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-19 14:46:25,246 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:46:25,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:25,252 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:25,252 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:25,252 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:25,252 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:25,253 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:46:25,253 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:25,253 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:25,253 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:25,253 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration2_Loop [2024-11-19 14:46:25,253 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:25,253 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:25,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:25,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:25,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:25,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:25,336 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:25,337 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:46:25,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:25,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:25,339 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:25,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-19 14:46:25,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:25,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:25,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:25,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:25,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:25,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:25,356 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:25,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:25,360 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:46:25,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-19 14:46:25,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:25,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:25,378 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:25,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-19 14:46:25,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:25,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:25,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:25,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:25,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:25,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:25,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:25,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:25,398 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:46:25,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:25,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:25,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:25,417 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:25,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-19 14:46:25,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:25,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:25,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:25,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:25,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:25,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:25,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:25,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:25,443 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:46:25,451 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:46:25,451 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:46:25,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:25,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:25,455 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:25,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-19 14:46:25,468 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:46:25,468 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:46:25,468 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:46:25,468 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -4*ULTIMATE.start_main_~j~0#1 + 7 Supporting invariants [] [2024-11-19 14:46:25,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:25,486 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:46:25,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:25,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:25,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:25,545 WARN L253 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:46:25,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:25,695 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2024-11-19 14:46:25,696 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:25,904 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 9. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 124 states and 156 transitions. Complement of second has 17 states. [2024-11-19 14:46:25,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:25,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:25,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2024-11-19 14:46:25,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 37 transitions. Stem has 8 letters. Loop has 6 letters. [2024-11-19 14:46:25,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:25,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 37 transitions. Stem has 14 letters. Loop has 6 letters. [2024-11-19 14:46:25,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:25,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 37 transitions. Stem has 8 letters. Loop has 12 letters. [2024-11-19 14:46:25,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:25,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 156 transitions. [2024-11-19 14:46:25,910 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2024-11-19 14:46:25,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 120 states and 152 transitions. [2024-11-19 14:46:25,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2024-11-19 14:46:25,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2024-11-19 14:46:25,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 152 transitions. [2024-11-19 14:46:25,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:25,916 INFO L218 hiAutomatonCegarLoop]: Abstraction has 120 states and 152 transitions. [2024-11-19 14:46:25,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 152 transitions. [2024-11-19 14:46:25,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 71. [2024-11-19 14:46:25,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.323943661971831) internal successors, (94), 70 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2024-11-19 14:46:25,924 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 94 transitions. [2024-11-19 14:46:25,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:46:25,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:46:25,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:46:25,927 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:25,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:46:25,951 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2024-11-19 14:46:25,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2024-11-19 14:46:25,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-19 14:46:25,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 36 transitions. [2024-11-19 14:46:25,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-19 14:46:25,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-19 14:46:25,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 36 transitions. [2024-11-19 14:46:25,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:25,953 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-11-19 14:46:25,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 36 transitions. [2024-11-19 14:46:25,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-11-19 14:46:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:25,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-19 14:46:25,955 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-19 14:46:25,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:46:25,957 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-19 14:46:25,958 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:46:25,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2024-11-19 14:46:25,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-19 14:46:25,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:25,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:25,959 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:25,959 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-19 14:46:25,959 INFO L745 eck$LassoCheckResult]: Stem: 521#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 503#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 497#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 498#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 502#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 501#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 499#L33-1 main_~i~0#1 := 0; 500#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 515#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 516#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 525#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 514#L35-3 [2024-11-19 14:46:25,959 INFO L747 eck$LassoCheckResult]: Loop: 514#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 504#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 506#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 522#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 510#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 511#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 514#L35-3 [2024-11-19 14:46:25,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:25,959 INFO L85 PathProgramCache]: Analyzing trace with hash -2088903000, now seen corresponding path program 2 times [2024-11-19 14:46:25,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:25,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034772085] [2024-11-19 14:46:25,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:46:25,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:25,977 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:46:25,977 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:25,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:25,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:25,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:25,992 INFO L85 PathProgramCache]: Analyzing trace with hash 2077305723, now seen corresponding path program 2 times [2024-11-19 14:46:25,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:25,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133250222] [2024-11-19 14:46:25,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:46:25,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:26,003 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:46:26,003 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:26,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:26,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:26,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:26,012 INFO L85 PathProgramCache]: Analyzing trace with hash -685690654, now seen corresponding path program 2 times [2024-11-19 14:46:26,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:26,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640676028] [2024-11-19 14:46:26,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:46:26,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:26,025 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:46:26,025 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:26,087 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 14:46:26,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:26,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640676028] [2024-11-19 14:46:26,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640676028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:46:26,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:46:26,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 14:46:26,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013548377] [2024-11-19 14:46:26,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:46:26,129 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:26,129 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:26,130 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:26,130 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:26,130 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:46:26,130 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:26,130 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:26,130 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:26,130 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration3_Loop [2024-11-19 14:46:26,130 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:26,130 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:26,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:26,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:26,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:26,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:26,189 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:26,189 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:46:26,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:26,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:26,191 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:26,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-19 14:46:26,194 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:26,194 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:26,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-19 14:46:26,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:26,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:26,228 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:26,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-19 14:46:26,230 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:46:26,230 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:26,422 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:46:26,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-19 14:46:26,429 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:26,429 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:26,430 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:26,430 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:26,430 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:46:26,430 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:26,430 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:26,430 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:26,430 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration3_Loop [2024-11-19 14:46:26,430 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:26,430 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:26,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:26,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:26,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:26,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:26,488 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:26,489 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:46:26,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:26,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:26,491 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:26,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-19 14:46:26,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:26,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:26,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:26,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:26,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:26,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:26,508 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:26,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:26,512 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:46:26,517 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-19 14:46:26,517 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-19 14:46:26,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:26,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:26,519 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:26,523 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:46:26,523 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:46:26,523 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:46:26,523 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 3 Supporting invariants [] [2024-11-19 14:46:26,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-19 14:46:26,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-19 14:46:26,539 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:46:26,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:26,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:26,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:26,597 WARN L253 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:46:26,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:26,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:26,721 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2024-11-19 14:46:26,721 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 8 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:26,728 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 8. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 29 states and 35 transitions. Complement of second has 3 states. [2024-11-19 14:46:26,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:26,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:26,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2024-11-19 14:46:26,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 11 letters. Loop has 6 letters. [2024-11-19 14:46:26,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:26,730 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:46:26,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:26,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:26,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:26,771 WARN L253 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:46:26,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:26,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:26,885 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2024-11-19 14:46:26,885 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 8 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:26,890 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 8. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 29 states and 35 transitions. Complement of second has 3 states. [2024-11-19 14:46:26,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:26,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:26,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2024-11-19 14:46:26,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 11 letters. Loop has 6 letters. [2024-11-19 14:46:26,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:26,892 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:46:26,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:26,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:26,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:26,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:26,969 WARN L253 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:46:26,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:26,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:27,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:27,075 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2024-11-19 14:46:27,075 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 8 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:27,233 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 8. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 111 states and 137 transitions. Complement of second has 16 states. [2024-11-19 14:46:27,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:27,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions. [2024-11-19 14:46:27,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 47 transitions. Stem has 11 letters. Loop has 6 letters. [2024-11-19 14:46:27,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:27,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 47 transitions. Stem has 17 letters. Loop has 6 letters. [2024-11-19 14:46:27,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:27,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 47 transitions. Stem has 11 letters. Loop has 12 letters. [2024-11-19 14:46:27,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:27,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 137 transitions. [2024-11-19 14:46:27,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2024-11-19 14:46:27,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 107 states and 133 transitions. [2024-11-19 14:46:27,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2024-11-19 14:46:27,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-11-19 14:46:27,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 133 transitions. [2024-11-19 14:46:27,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:27,242 INFO L218 hiAutomatonCegarLoop]: Abstraction has 107 states and 133 transitions. [2024-11-19 14:46:27,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 133 transitions. [2024-11-19 14:46:27,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 56. [2024-11-19 14:46:27,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 55 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:27,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2024-11-19 14:46:27,249 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 73 transitions. [2024-11-19 14:46:27,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:46:27,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:46:27,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:46:27,250 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:27,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:46:27,276 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2024-11-19 14:46:27,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2024-11-19 14:46:27,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-11-19 14:46:27,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 31 states and 37 transitions. [2024-11-19 14:46:27,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-19 14:46:27,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-19 14:46:27,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 37 transitions. [2024-11-19 14:46:27,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:27,278 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-19 14:46:27,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 37 transitions. [2024-11-19 14:46:27,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-19 14:46:27,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:27,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-19 14:46:27,280 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-19 14:46:27,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:46:27,281 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-19 14:46:27,281 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:46:27,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2024-11-19 14:46:27,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-11-19 14:46:27,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:27,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:27,282 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:27,282 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:27,282 INFO L745 eck$LassoCheckResult]: Stem: 1032#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 1014#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 1008#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 1009#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 1013#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 1012#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 1010#L33-1 main_~i~0#1 := 0; 1011#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 1024#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 1025#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1038#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 1023#L35-3 [2024-11-19 14:46:27,282 INFO L747 eck$LassoCheckResult]: Loop: 1023#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 1015#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1016#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1030#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1026#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1027#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 1033#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1034#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 1019#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1020#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 1023#L35-3 [2024-11-19 14:46:27,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:27,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2088903000, now seen corresponding path program 3 times [2024-11-19 14:46:27,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:27,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659277457] [2024-11-19 14:46:27,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:46:27,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:27,290 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 14:46:27,291 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:27,291 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:27,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:27,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:27,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1724980661, now seen corresponding path program 1 times [2024-11-19 14:46:27,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:27,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571648998] [2024-11-19 14:46:27,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:27,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:27,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:27,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:27,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:27,325 INFO L85 PathProgramCache]: Analyzing trace with hash 413129778, now seen corresponding path program 1 times [2024-11-19 14:46:27,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:27,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864451885] [2024-11-19 14:46:27,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:27,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:27,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:27,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:27,429 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:27,429 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:27,429 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:27,429 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:27,430 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:46:27,430 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:27,430 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:27,430 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:27,430 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration4_Loop [2024-11-19 14:46:27,430 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:27,430 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:27,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:27,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:27,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:27,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:27,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:27,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:27,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:27,503 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:27,503 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:46:27,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:27,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:27,507 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:27,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-19 14:46:27,510 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:27,510 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:27,524 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:27,524 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5#1=0} Honda state: {ULTIMATE.start_main_#t~post5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:27,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-19 14:46:27,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:27,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:27,540 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:27,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-19 14:46:27,543 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:27,543 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:27,557 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:27,557 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:27,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-19 14:46:27,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:27,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:27,573 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:27,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-19 14:46:27,577 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:27,577 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:27,594 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:27,594 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:27,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:27,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:27,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:27,610 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:27,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-19 14:46:27,614 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:27,614 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:27,629 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:27,630 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6#1=0} Honda state: {ULTIMATE.start_main_#t~post6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:27,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:27,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:27,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:27,646 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:27,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-19 14:46:27,648 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:27,648 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:27,660 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:27,660 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4#1=0} Honda state: {ULTIMATE.start_main_#t~post4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:27,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:27,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:27,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:27,671 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:27,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-19 14:46:27,673 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:27,673 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:27,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:27,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:27,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:27,696 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:27,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-19 14:46:27,697 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:46:27,697 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:27,867 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:46:27,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:27,872 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:27,873 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:27,873 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:27,873 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:27,873 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:46:27,873 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:27,873 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:27,873 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:27,873 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration4_Loop [2024-11-19 14:46:27,873 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:27,873 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:27,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:27,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:27,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:27,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:27,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:27,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:27,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:27,947 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:27,947 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:46:27,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:27,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:27,949 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:27,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:27,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-19 14:46:27,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:27,966 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:27,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:27,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:27,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:27,967 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:27,967 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:27,968 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:46:27,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:27,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:27,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:27,983 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:27,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-19 14:46:27,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:27,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:27,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:27,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:27,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:27,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:27,996 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:27,996 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:27,997 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:46:28,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:28,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:28,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:28,012 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:28,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-19 14:46:28,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:28,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:28,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:28,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:28,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:28,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:28,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:28,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:28,027 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:46:28,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:28,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:28,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:28,049 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:28,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-19 14:46:28,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:28,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:28,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:28,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:28,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:28,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:28,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:28,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:28,070 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:46:28,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-19 14:46:28,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:28,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:28,090 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:28,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-19 14:46:28,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:28,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:28,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:28,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:28,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:28,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:28,107 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:28,107 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:28,110 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:46:28,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:28,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:28,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:28,127 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:28,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-19 14:46:28,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:28,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:28,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:28,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:28,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:28,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:28,145 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:28,145 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:28,149 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:46:28,152 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:46:28,152 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:46:28,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:28,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:28,154 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:28,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-19 14:46:28,156 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:46:28,156 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:46:28,157 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:46:28,157 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -1*ULTIMATE.start_main_~j~0#1 + 3 Supporting invariants [] [2024-11-19 14:46:28,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:28,173 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:46:28,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:28,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:28,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:28,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:46:28,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:28,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:28,352 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2024-11-19 14:46:28,352 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 37 transitions. cyclomatic complexity: 8 Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:28,359 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 37 transitions. cyclomatic complexity: 8. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 37 transitions. Complement of second has 3 states. [2024-11-19 14:46:28,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:28,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:28,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2024-11-19 14:46:28,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 11 letters. Loop has 10 letters. [2024-11-19 14:46:28,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:28,361 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:46:28,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:28,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:28,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:28,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:46:28,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:28,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:28,546 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2024-11-19 14:46:28,546 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 37 transitions. cyclomatic complexity: 8 Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:28,557 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 37 transitions. cyclomatic complexity: 8. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 37 transitions. Complement of second has 3 states. [2024-11-19 14:46:28,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:28,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:28,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2024-11-19 14:46:28,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 11 letters. Loop has 10 letters. [2024-11-19 14:46:28,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:28,560 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:46:28,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:28,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:28,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:28,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:46:28,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:28,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:28,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:28,741 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2024-11-19 14:46:28,741 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 37 transitions. cyclomatic complexity: 8 Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:28,934 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 37 transitions. cyclomatic complexity: 8. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 143 states and 168 transitions. Complement of second has 20 states. [2024-11-19 14:46:28,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:28,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:28,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2024-11-19 14:46:28,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 55 transitions. Stem has 11 letters. Loop has 10 letters. [2024-11-19 14:46:28,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:28,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 55 transitions. Stem has 21 letters. Loop has 10 letters. [2024-11-19 14:46:28,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:28,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 55 transitions. Stem has 11 letters. Loop has 20 letters. [2024-11-19 14:46:28,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:28,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 168 transitions. [2024-11-19 14:46:28,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2024-11-19 14:46:28,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 139 states and 164 transitions. [2024-11-19 14:46:28,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2024-11-19 14:46:28,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2024-11-19 14:46:28,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 164 transitions. [2024-11-19 14:46:28,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:28,939 INFO L218 hiAutomatonCegarLoop]: Abstraction has 139 states and 164 transitions. [2024-11-19 14:46:28,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 164 transitions. [2024-11-19 14:46:28,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 72. [2024-11-19 14:46:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 71 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:28,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2024-11-19 14:46:28,946 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 89 transitions. [2024-11-19 14:46:28,946 INFO L425 stractBuchiCegarLoop]: Abstraction has 72 states and 89 transitions. [2024-11-19 14:46:28,946 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:46:28,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 89 transitions. [2024-11-19 14:46:28,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2024-11-19 14:46:28,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:28,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:28,952 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:28,953 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:28,953 INFO L745 eck$LassoCheckResult]: Stem: 1525#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 1504#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 1498#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 1499#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 1503#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 1502#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 1500#L33-1 main_~i~0#1 := 0; 1501#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 1529#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 1538#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1534#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 1536#L35-3 [2024-11-19 14:46:28,953 INFO L747 eck$LassoCheckResult]: Loop: 1536#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 1505#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1506#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1539#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1516#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1517#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1520#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1521#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1524#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1537#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 1533#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1532#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 1509#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1510#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 1536#L35-3 [2024-11-19 14:46:28,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:28,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2088903000, now seen corresponding path program 4 times [2024-11-19 14:46:28,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:28,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764682574] [2024-11-19 14:46:28,954 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:46:28,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:28,963 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:46:28,963 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:28,964 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:28,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:28,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:28,971 INFO L85 PathProgramCache]: Analyzing trace with hash -801853157, now seen corresponding path program 2 times [2024-11-19 14:46:28,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:28,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023283877] [2024-11-19 14:46:28,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:46:28,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:28,985 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:46:28,985 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:29,109 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:29,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:29,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023283877] [2024-11-19 14:46:29,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023283877] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:46:29,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825643773] [2024-11-19 14:46:29,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:46:29,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:46:29,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:29,112 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:46:29,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-19 14:46:29,150 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:46:29,150 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:29,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 14:46:29,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:29,282 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:29,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:46:29,416 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:29,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825643773] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:46:29,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:46:29,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-11-19 14:46:29,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244775575] [2024-11-19 14:46:29,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:46:29,417 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:46:29,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:46:29,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 14:46:29,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2024-11-19 14:46:29,418 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. cyclomatic complexity: 19 Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:29,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:46:29,911 INFO L93 Difference]: Finished difference Result 308 states and 365 transitions. [2024-11-19 14:46:29,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 308 states and 365 transitions. [2024-11-19 14:46:29,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 150 [2024-11-19 14:46:29,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 308 states to 308 states and 365 transitions. [2024-11-19 14:46:29,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2024-11-19 14:46:29,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2024-11-19 14:46:29,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 308 states and 365 transitions. [2024-11-19 14:46:29,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:29,919 INFO L218 hiAutomatonCegarLoop]: Abstraction has 308 states and 365 transitions. [2024-11-19 14:46:29,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states and 365 transitions. [2024-11-19 14:46:29,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 224. [2024-11-19 14:46:29,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 224 states have (on average 1.1830357142857142) internal successors, (265), 223 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:29,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 265 transitions. [2024-11-19 14:46:29,937 INFO L240 hiAutomatonCegarLoop]: Abstraction has 224 states and 265 transitions. [2024-11-19 14:46:29,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-19 14:46:29,938 INFO L425 stractBuchiCegarLoop]: Abstraction has 224 states and 265 transitions. [2024-11-19 14:46:29,938 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:46:29,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 224 states and 265 transitions. [2024-11-19 14:46:29,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 108 [2024-11-19 14:46:29,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:29,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:29,941 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:29,941 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:29,941 INFO L745 eck$LassoCheckResult]: Stem: 2044#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 2025#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 2019#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 2020#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 2024#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 2023#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 2021#L33-1 main_~i~0#1 := 0; 2022#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 2048#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 2055#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2107#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 2105#L35-3 [2024-11-19 14:46:29,941 INFO L747 eck$LassoCheckResult]: Loop: 2105#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 2051#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2090#L18 assume !(0 == __VERIFIER_assert_~cond#1); 2086#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2087#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2082#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2083#L18 assume !(0 == __VERIFIER_assert_~cond#1); 2076#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2077#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2062#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2063#L18 assume !(0 == __VERIFIER_assert_~cond#1); 2058#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2059#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2053#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 2052#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2050#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 2031#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2032#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 2105#L35-3 [2024-11-19 14:46:29,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:29,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2088903000, now seen corresponding path program 5 times [2024-11-19 14:46:29,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:29,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412092568] [2024-11-19 14:46:29,942 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:46:29,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:29,952 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:46:29,953 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:29,953 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:29,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:29,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:29,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1595316203, now seen corresponding path program 3 times [2024-11-19 14:46:29,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:29,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334819137] [2024-11-19 14:46:29,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:46:29,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:29,966 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-19 14:46:29,966 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:29,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:29,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:29,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:29,982 INFO L85 PathProgramCache]: Analyzing trace with hash -935413038, now seen corresponding path program 2 times [2024-11-19 14:46:29,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:29,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939152262] [2024-11-19 14:46:29,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:46:29,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:29,990 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:46:29,990 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 14:46:30,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:30,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939152262] [2024-11-19 14:46:30,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939152262] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:46:30,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185666570] [2024-11-19 14:46:30,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:46:30,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:46:30,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:30,079 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:46:30,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-19 14:46:30,121 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:46:30,121 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:30,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:46:30,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:30,178 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 14:46:30,179 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:46:30,212 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 14:46:30,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185666570] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:46:30,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:46:30,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 11 [2024-11-19 14:46:30,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644485884] [2024-11-19 14:46:30,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:46:30,332 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:30,332 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:30,332 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:30,332 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:30,332 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:46:30,332 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:30,332 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:30,333 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:30,333 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration6_Loop [2024-11-19 14:46:30,333 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:30,333 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:30,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:30,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:30,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:30,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:30,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:30,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:30,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:30,406 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:30,406 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:46:30,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:30,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:30,410 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:30,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-19 14:46:30,413 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:30,413 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:30,429 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:30,429 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4#1=0} Honda state: {ULTIMATE.start_main_#t~post4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:30,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:30,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:30,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:30,445 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:30,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-19 14:46:30,448 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:30,448 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:30,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:30,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:30,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:30,478 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:30,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-19 14:46:30,481 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:46:30,481 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:30,563 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:46:30,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:30,568 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:30,568 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:30,568 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:30,568 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:30,568 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:46:30,568 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:30,568 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:30,568 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:30,568 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration6_Loop [2024-11-19 14:46:30,569 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:30,569 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:30,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:30,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:30,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:30,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:30,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:30,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:30,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:30,639 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:30,639 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:46:30,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:30,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:30,641 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:30,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-19 14:46:30,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:30,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:30,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:30,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:30,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:30,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:30,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:30,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:30,654 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:46:30,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-11-19 14:46:30,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:30,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:30,665 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:30,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-19 14:46:30,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:30,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:30,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:30,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:30,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:30,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:30,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:30,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:30,681 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:46:30,684 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:46:30,684 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:46:30,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:30,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:30,686 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:30,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-19 14:46:30,688 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:46:30,689 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:46:30,689 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:46:30,689 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 5 Supporting invariants [] [2024-11-19 14:46:30,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:30,703 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:46:30,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:30,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:30,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:30,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:46:30,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:30,898 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:30,899 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2024-11-19 14:46:30,899 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 224 states and 265 transitions. cyclomatic complexity: 43 Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:31,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:31,165 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 224 states and 265 transitions. cyclomatic complexity: 43. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 690 states and 823 transitions. Complement of second has 26 states. [2024-11-19 14:46:31,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:31,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:31,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2024-11-19 14:46:31,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 65 transitions. Stem has 11 letters. Loop has 18 letters. [2024-11-19 14:46:31,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:31,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 65 transitions. Stem has 29 letters. Loop has 18 letters. [2024-11-19 14:46:31,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:31,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 65 transitions. Stem has 11 letters. Loop has 36 letters. [2024-11-19 14:46:31,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:31,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 690 states and 823 transitions. [2024-11-19 14:46:31,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2024-11-19 14:46:31,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 690 states to 547 states and 653 transitions. [2024-11-19 14:46:31,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 105 [2024-11-19 14:46:31,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2024-11-19 14:46:31,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 547 states and 653 transitions. [2024-11-19 14:46:31,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:31,182 INFO L218 hiAutomatonCegarLoop]: Abstraction has 547 states and 653 transitions. [2024-11-19 14:46:31,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states and 653 transitions. [2024-11-19 14:46:31,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 355. [2024-11-19 14:46:31,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 355 states have (on average 1.1971830985915493) internal successors, (425), 354 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:31,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 425 transitions. [2024-11-19 14:46:31,194 INFO L240 hiAutomatonCegarLoop]: Abstraction has 355 states and 425 transitions. [2024-11-19 14:46:31,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:46:31,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 14:46:31,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-19 14:46:31,195 INFO L87 Difference]: Start difference. First operand 355 states and 425 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:31,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:46:31,278 INFO L93 Difference]: Finished difference Result 409 states and 487 transitions. [2024-11-19 14:46:31,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 409 states and 487 transitions. [2024-11-19 14:46:31,280 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 68 [2024-11-19 14:46:31,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 409 states to 388 states and 463 transitions. [2024-11-19 14:46:31,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2024-11-19 14:46:31,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2024-11-19 14:46:31,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 388 states and 463 transitions. [2024-11-19 14:46:31,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:31,283 INFO L218 hiAutomatonCegarLoop]: Abstraction has 388 states and 463 transitions. [2024-11-19 14:46:31,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states and 463 transitions. [2024-11-19 14:46:31,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2024-11-19 14:46:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 383 states have (on average 1.195822454308094) internal successors, (458), 382 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:31,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 458 transitions. [2024-11-19 14:46:31,292 INFO L240 hiAutomatonCegarLoop]: Abstraction has 383 states and 458 transitions. [2024-11-19 14:46:31,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 14:46:31,292 INFO L425 stractBuchiCegarLoop]: Abstraction has 383 states and 458 transitions. [2024-11-19 14:46:31,292 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:46:31,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 383 states and 458 transitions. [2024-11-19 14:46:31,294 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 68 [2024-11-19 14:46:31,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:31,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:31,294 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:31,294 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:31,295 INFO L745 eck$LassoCheckResult]: Stem: 4058#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 4036#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 4030#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 4031#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 4035#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 4034#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 4032#L33-1 main_~i~0#1 := 0; 4033#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 4062#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 4129#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 4127#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 4126#L35-3 [2024-11-19 14:46:31,295 INFO L747 eck$LassoCheckResult]: Loop: 4126#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 4125#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4052#L18 assume !(0 == __VERIFIER_assert_~cond#1); 4053#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 4049#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4037#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 4038#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4126#L35-3 [2024-11-19 14:46:31,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:31,295 INFO L85 PathProgramCache]: Analyzing trace with hash -2088903000, now seen corresponding path program 6 times [2024-11-19 14:46:31,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:31,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504296465] [2024-11-19 14:46:31,296 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:46:31,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:31,300 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-11-19 14:46:31,300 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:31,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:31,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:31,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:31,305 INFO L85 PathProgramCache]: Analyzing trace with hash 21711760, now seen corresponding path program 1 times [2024-11-19 14:46:31,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:31,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763037760] [2024-11-19 14:46:31,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:31,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:31,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:31,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:31,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:31,313 INFO L85 PathProgramCache]: Analyzing trace with hash 268169993, now seen corresponding path program 3 times [2024-11-19 14:46:31,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:31,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675547605] [2024-11-19 14:46:31,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:46:31,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:31,318 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 14:46:31,318 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:31,318 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:31,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:31,372 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:31,372 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:31,373 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:31,373 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:31,373 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:46:31,373 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,373 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:31,373 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:31,373 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration7_Loop [2024-11-19 14:46:31,373 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:31,373 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:31,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,422 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:31,422 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:46:31,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,424 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:31,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-19 14:46:31,427 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:31,427 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:31,448 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:31,448 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0#1=0} Honda state: {ULTIMATE.start_main_~n~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:31,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-11-19 14:46:31,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,465 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:31,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-19 14:46:31,466 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:31,467 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:31,484 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:31,484 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:31,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:31,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,498 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:31,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-19 14:46:31,500 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:31,500 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:31,511 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:31,511 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0#1=0} Honda state: {ULTIMATE.start_main_~k~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:31,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:31,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,523 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:31,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-19 14:46:31,525 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:31,525 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:31,535 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:31,536 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4#1=0} Honda state: {ULTIMATE.start_main_#t~post4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:31,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-11-19 14:46:31,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,548 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:31,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-19 14:46:31,550 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:31,550 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:31,561 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:31,561 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:31,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:31,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,572 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:31,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-19 14:46:31,574 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:31,574 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:31,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-11-19 14:46:31,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,596 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:31,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-19 14:46:31,598 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:46:31,598 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:31,700 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:46:31,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-11-19 14:46:31,705 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:31,705 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:31,705 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:31,705 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:31,705 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:46:31,705 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,705 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:31,705 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:31,705 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration7_Loop [2024-11-19 14:46:31,705 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:31,705 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:31,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,763 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:31,763 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:46:31,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,766 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:31,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-19 14:46:31,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:31,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:31,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:31,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:31,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:31,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:31,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:31,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:31,779 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:46:31,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-11-19 14:46:31,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,790 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:31,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-19 14:46:31,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:31,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:31,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:31,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:31,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:31,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:31,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:31,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:31,803 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:46:31,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:31,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,815 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:31,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-19 14:46:31,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:31,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:31,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:31,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:31,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:31,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:31,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:31,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:31,828 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:46:31,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-11-19 14:46:31,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,845 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:31,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-19 14:46:31,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:31,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:31,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:31,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:31,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:31,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:31,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:31,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:31,863 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:46:31,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:31,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,880 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:31,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-19 14:46:31,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:31,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:31,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:31,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:31,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:31,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:31,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:31,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:31,896 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:46:31,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:31,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,911 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:31,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-19 14:46:31,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:31,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:31,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:31,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:31,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:31,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:31,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:31,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:31,925 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:46:31,927 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:46:31,927 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:46:31,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,928 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:31,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-19 14:46:31,930 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:46:31,930 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:46:31,930 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:46:31,930 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~j~0#1) = 3*ULTIMATE.start_main_~i~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-11-19 14:46:31,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-11-19 14:46:31,941 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:46:31,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:31,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:31,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:31,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:46:31,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:32,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 14:46:32,011 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:46:32,012 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 383 states and 458 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:32,017 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 383 states and 458 transitions. cyclomatic complexity: 84. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 383 states and 458 transitions. Complement of second has 3 states. [2024-11-19 14:46:32,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:32,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:32,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2024-11-19 14:46:32,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 11 letters. Loop has 7 letters. [2024-11-19 14:46:32,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:32,019 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:46:32,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:32,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:32,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:32,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:46:32,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:32,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 14:46:32,087 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:46:32,087 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 383 states and 458 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:32,095 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 383 states and 458 transitions. cyclomatic complexity: 84. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 383 states and 458 transitions. Complement of second has 3 states. [2024-11-19 14:46:32,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:32,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:32,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2024-11-19 14:46:32,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 11 letters. Loop has 7 letters. [2024-11-19 14:46:32,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:32,096 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:46:32,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:32,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:32,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:32,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:46:32,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:32,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 14:46:32,177 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:46:32,177 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 383 states and 458 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:32,196 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 383 states and 458 transitions. cyclomatic complexity: 84. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 815 states and 981 transitions. Complement of second has 4 states. [2024-11-19 14:46:32,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:32,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2024-11-19 14:46:32,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 11 letters. Loop has 7 letters. [2024-11-19 14:46:32,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:32,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 18 letters. Loop has 7 letters. [2024-11-19 14:46:32,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:32,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 11 letters. Loop has 14 letters. [2024-11-19 14:46:32,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:32,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 815 states and 981 transitions. [2024-11-19 14:46:32,207 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 70 [2024-11-19 14:46:32,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 815 states to 531 states and 628 transitions. [2024-11-19 14:46:32,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2024-11-19 14:46:32,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2024-11-19 14:46:32,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 531 states and 628 transitions. [2024-11-19 14:46:32,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:32,210 INFO L218 hiAutomatonCegarLoop]: Abstraction has 531 states and 628 transitions. [2024-11-19 14:46:32,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states and 628 transitions. [2024-11-19 14:46:32,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 378. [2024-11-19 14:46:32,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 378 states have (on average 1.2063492063492063) internal successors, (456), 377 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:32,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 456 transitions. [2024-11-19 14:46:32,217 INFO L240 hiAutomatonCegarLoop]: Abstraction has 378 states and 456 transitions. [2024-11-19 14:46:32,217 INFO L425 stractBuchiCegarLoop]: Abstraction has 378 states and 456 transitions. [2024-11-19 14:46:32,217 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 14:46:32,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 378 states and 456 transitions. [2024-11-19 14:46:32,218 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 66 [2024-11-19 14:46:32,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:32,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:32,220 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:32,220 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:32,221 INFO L745 eck$LassoCheckResult]: Stem: 6206#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 6189#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 6179#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 6180#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 6184#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 6183#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 6181#L33-1 main_~i~0#1 := 0; 6182#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 6209#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 6255#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 6256#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 6194#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 6195#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 6545#L18 assume !(0 == __VERIFIER_assert_~cond#1); 6544#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 6543#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6497#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 6498#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6546#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 6281#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 6248#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 6247#L35-3 [2024-11-19 14:46:32,221 INFO L747 eck$LassoCheckResult]: Loop: 6247#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 6213#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 6266#L18 assume !(0 == __VERIFIER_assert_~cond#1); 6265#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 6240#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6241#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 6236#L18 assume !(0 == __VERIFIER_assert_~cond#1); 6237#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 6232#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6233#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 6229#L18 assume !(0 == __VERIFIER_assert_~cond#1); 6228#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 6227#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6225#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 6224#L18 assume !(0 == __VERIFIER_assert_~cond#1); 6223#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 6221#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6222#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 6216#L18 assume !(0 == __VERIFIER_assert_~cond#1); 6218#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 6217#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6215#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 6214#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6212#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 6190#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 6191#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 6247#L35-3 [2024-11-19 14:46:32,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:32,221 INFO L85 PathProgramCache]: Analyzing trace with hash 413129778, now seen corresponding path program 4 times [2024-11-19 14:46:32,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:32,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632483366] [2024-11-19 14:46:32,221 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:46:32,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:32,229 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:46:32,229 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:32,229 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:32,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:32,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:32,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1530834315, now seen corresponding path program 4 times [2024-11-19 14:46:32,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:32,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194105991] [2024-11-19 14:46:32,236 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:46:32,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:32,247 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:46:32,248 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:32,248 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:32,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:32,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:32,261 INFO L85 PathProgramCache]: Analyzing trace with hash 2114436732, now seen corresponding path program 5 times [2024-11-19 14:46:32,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:32,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479885743] [2024-11-19 14:46:32,261 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:46:32,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:32,282 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-19 14:46:32,284 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:32,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:32,460 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 67 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 14:46:32,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:32,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479885743] [2024-11-19 14:46:32,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479885743] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:46:32,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779538706] [2024-11-19 14:46:32,461 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:46:32,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:46:32,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:32,462 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:46:32,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2024-11-19 14:46:32,513 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-19 14:46:32,513 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:32,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 14:46:32,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:32,698 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 68 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 14:46:32,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:46:32,903 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 68 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 14:46:32,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779538706] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:46:32,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:46:32,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 27 [2024-11-19 14:46:32,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310834457] [2024-11-19 14:46:32,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:46:33,069 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:33,069 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:33,069 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:33,069 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:33,069 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:46:33,070 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:33,070 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:33,070 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:33,070 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration8_Loop [2024-11-19 14:46:33,070 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:33,070 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:33,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:33,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:33,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:33,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:33,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:33,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:33,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:33,133 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:33,133 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:46:33,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:33,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:33,134 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:33,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-11-19 14:46:33,136 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:33,136 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:33,148 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:33,148 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4#1=0} Honda state: {ULTIMATE.start_main_#t~post4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:33,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:33,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:33,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:33,159 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:33,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-19 14:46:33,160 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:33,160 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:33,171 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:33,171 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:33,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-11-19 14:46:33,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:33,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:33,182 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:33,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-11-19 14:46:33,184 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:33,184 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:33,195 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:33,195 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6#1=0} Honda state: {ULTIMATE.start_main_#t~post6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:33,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:33,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:33,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:33,206 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:33,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-11-19 14:46:33,208 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:33,208 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:33,218 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:33,219 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0#1=0} Honda state: {ULTIMATE.start_main_~k~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:33,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2024-11-19 14:46:33,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:33,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:33,230 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:33,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-11-19 14:46:33,231 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:33,231 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:33,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-11-19 14:46:33,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:33,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:33,259 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:33,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-11-19 14:46:33,261 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:46:33,261 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:33,330 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:46:33,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-11-19 14:46:33,334 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:33,334 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:33,335 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:33,335 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:33,335 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:46:33,335 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:33,335 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:33,335 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:33,335 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration8_Loop [2024-11-19 14:46:33,335 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:33,335 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:33,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:33,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:33,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:33,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:33,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:33,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:33,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:33,404 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:33,404 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:46:33,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:33,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:33,406 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:33,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-11-19 14:46:33,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:33,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:33,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:33,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:33,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:33,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:33,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:33,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:33,420 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:46:33,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:33,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:33,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:33,431 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:33,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-11-19 14:46:33,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:33,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:33,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:33,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:33,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:33,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:33,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:33,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:33,443 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:46:33,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2024-11-19 14:46:33,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:33,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:33,455 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:33,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-11-19 14:46:33,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:33,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:33,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:33,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:33,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:33,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:33,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:33,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:33,468 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:46:33,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:33,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:33,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:33,479 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:33,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-11-19 14:46:33,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:33,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:33,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:33,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:33,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:33,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:33,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:33,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:33,496 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:46:33,498 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:46:33,498 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:46:33,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:33,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:33,500 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:33,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-11-19 14:46:33,501 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:46:33,501 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:46:33,501 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:46:33,501 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 7 Supporting invariants [] [2024-11-19 14:46:33,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:33,512 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:46:33,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:33,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:33,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:33,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 14:46:33,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:33,775 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:33,776 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2024-11-19 14:46:33,776 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 378 states and 456 transitions. cyclomatic complexity: 86 Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:34,115 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 378 states and 456 transitions. cyclomatic complexity: 86. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1442 states and 1730 transitions. Complement of second has 34 states. [2024-11-19 14:46:34,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 1 stem states 16 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:34,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:34,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 85 transitions. [2024-11-19 14:46:34,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 85 transitions. Stem has 21 letters. Loop has 26 letters. [2024-11-19 14:46:34,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:34,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 85 transitions. Stem has 47 letters. Loop has 26 letters. [2024-11-19 14:46:34,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:34,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 85 transitions. Stem has 21 letters. Loop has 52 letters. [2024-11-19 14:46:34,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:34,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1442 states and 1730 transitions. [2024-11-19 14:46:34,127 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 119 [2024-11-19 14:46:34,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1442 states to 953 states and 1144 transitions. [2024-11-19 14:46:34,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2024-11-19 14:46:34,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2024-11-19 14:46:34,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 953 states and 1144 transitions. [2024-11-19 14:46:34,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:34,132 INFO L218 hiAutomatonCegarLoop]: Abstraction has 953 states and 1144 transitions. [2024-11-19 14:46:34,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states and 1144 transitions. [2024-11-19 14:46:34,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 528. [2024-11-19 14:46:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 528 states have (on average 1.2121212121212122) internal successors, (640), 527 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 640 transitions. [2024-11-19 14:46:34,141 INFO L240 hiAutomatonCegarLoop]: Abstraction has 528 states and 640 transitions. [2024-11-19 14:46:34,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:46:34,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-19 14:46:34,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702 [2024-11-19 14:46:34,142 INFO L87 Difference]: Start difference. First operand 528 states and 640 transitions. Second operand has 27 states, 27 states have (on average 3.0) internal successors, (81), 27 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:34,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2024-11-19 14:46:35,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:46:35,301 INFO L93 Difference]: Finished difference Result 3939 states and 4582 transitions. [2024-11-19 14:46:35,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3939 states and 4582 transitions. [2024-11-19 14:46:35,321 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 351 [2024-11-19 14:46:35,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3939 states to 3653 states and 4268 transitions. [2024-11-19 14:46:35,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2024-11-19 14:46:35,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2024-11-19 14:46:35,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3653 states and 4268 transitions. [2024-11-19 14:46:35,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:35,340 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3653 states and 4268 transitions. [2024-11-19 14:46:35,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3653 states and 4268 transitions. [2024-11-19 14:46:35,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3653 to 2051. [2024-11-19 14:46:35,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2051 states, 2051 states have (on average 1.1755241345685032) internal successors, (2411), 2050 states have internal predecessors, (2411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:35,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 2411 transitions. [2024-11-19 14:46:35,382 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2051 states and 2411 transitions. [2024-11-19 14:46:35,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-19 14:46:35,382 INFO L425 stractBuchiCegarLoop]: Abstraction has 2051 states and 2411 transitions. [2024-11-19 14:46:35,382 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-19 14:46:35,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2051 states and 2411 transitions. [2024-11-19 14:46:35,390 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 168 [2024-11-19 14:46:35,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:35,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:35,391 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 8, 8, 5, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:35,391 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:46:35,392 INFO L745 eck$LassoCheckResult]: Stem: 13140#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 13123#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 13117#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 13118#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 13122#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 13121#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 13119#L33-1 main_~i~0#1 := 0; 13120#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 13142#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 14470#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 13160#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 13132#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 13133#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 15135#L18 assume !(0 == __VERIFIER_assert_~cond#1); 15134#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 15133#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 15132#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 15131#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13420#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 13419#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 13417#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 13418#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 13404#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 13403#L18 assume !(0 == __VERIFIER_assert_~cond#1); 13402#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 13401#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13400#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 13398#L18 assume !(0 == __VERIFIER_assert_~cond#1); 13397#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 13396#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13395#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 13394#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13393#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 13391#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 13392#L18 assume !(0 == __VERIFIER_assert_~cond#1); 13387#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 13388#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13383#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 13384#L18 assume !(0 == __VERIFIER_assert_~cond#1); 13379#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 13380#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13376#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 13375#L18 assume !(0 == __VERIFIER_assert_~cond#1); 13374#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 13342#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13335#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 13334#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13332#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 13331#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 13327#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 13330#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 13317#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 13318#L18 assume !(0 == __VERIFIER_assert_~cond#1); 13313#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 13314#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13309#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 13310#L18 assume !(0 == __VERIFIER_assert_~cond#1); 13305#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 13306#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13301#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 13280#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13281#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 13124#L36-3 [2024-11-19 14:46:35,392 INFO L747 eck$LassoCheckResult]: Loop: 13124#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 13125#L18 assume !(0 == __VERIFIER_assert_~cond#1); 13138#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 13135#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13124#L36-3 [2024-11-19 14:46:35,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:35,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1573021760, now seen corresponding path program 6 times [2024-11-19 14:46:35,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:35,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45033181] [2024-11-19 14:46:35,393 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:46:35,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:35,424 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2024-11-19 14:46:35,425 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:35,609 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 113 proven. 46 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 14:46:35,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:35,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45033181] [2024-11-19 14:46:35,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45033181] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:46:35,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147634718] [2024-11-19 14:46:35,610 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:46:35,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:46:35,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:35,613 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:46:35,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2024-11-19 14:46:35,680 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2024-11-19 14:46:35,680 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:35,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 14:46:35,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:35,828 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 114 proven. 45 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 14:46:35,828 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:46:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 122 proven. 37 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 14:46:35,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147634718] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:46:35,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:46:35,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2024-11-19 14:46:35,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023394685] [2024-11-19 14:46:35,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:46:35,943 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:46:35,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:35,943 INFO L85 PathProgramCache]: Analyzing trace with hash 2415153, now seen corresponding path program 1 times [2024-11-19 14:46:35,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:35,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891324019] [2024-11-19 14:46:35,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:35,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:35,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:35,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:35,971 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:35,971 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:35,971 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:35,971 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:35,971 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:46:35,971 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:35,971 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:35,971 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:35,972 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration9_Loop [2024-11-19 14:46:35,972 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:35,972 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:35,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:35,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:35,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:35,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:36,007 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:36,007 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:46:36,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:36,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:36,009 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:36,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-11-19 14:46:36,011 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:36,011 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:36,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:36,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:36,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:36,042 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:36,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-11-19 14:46:36,044 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:46:36,044 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:36,205 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:46:36,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2024-11-19 14:46:36,210 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:36,210 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:36,210 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:36,211 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:36,211 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:46:36,211 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:36,211 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:36,211 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:36,211 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration9_Loop [2024-11-19 14:46:36,211 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:36,211 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:36,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:36,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:36,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:36,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:36,242 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:36,243 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:46:36,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:36,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:36,244 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:36,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-11-19 14:46:36,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:36,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:36,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:36,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:36,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:36,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:36,256 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:36,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:36,258 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:46:36,260 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:46:36,261 INFO L444 ModelExtractionUtils]: 1 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:46:36,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:36,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:36,262 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:36,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-11-19 14:46:36,263 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:46:36,263 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:46:36,263 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:46:36,263 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~k~0#1) = 4*ULTIMATE.start_main_~n~0#1 + 2*ULTIMATE.start_main_~i~0#1 - 2*ULTIMATE.start_main_~k~0#1 + 1 Supporting invariants [] [2024-11-19 14:46:36,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-11-19 14:46:36,274 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:46:36,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:36,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:36,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:36,380 WARN L253 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 14:46:36,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:36,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:36,432 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-19 14:46:36,433 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2051 states and 2411 transitions. cyclomatic complexity: 372 Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:36,471 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2051 states and 2411 transitions. cyclomatic complexity: 372. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2067 states and 2427 transitions. Complement of second has 7 states. [2024-11-19 14:46:36,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:36,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:36,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2024-11-19 14:46:36,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 62 letters. Loop has 4 letters. [2024-11-19 14:46:36,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:36,473 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:46:36,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:36,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:36,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:36,577 WARN L253 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 14:46:36,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:36,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:36,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:36,650 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-19 14:46:36,650 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2051 states and 2411 transitions. cyclomatic complexity: 372 Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:36,682 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2051 states and 2411 transitions. cyclomatic complexity: 372. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2067 states and 2427 transitions. Complement of second has 7 states. [2024-11-19 14:46:36,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:36,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:36,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2024-11-19 14:46:36,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 62 letters. Loop has 4 letters. [2024-11-19 14:46:36,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:36,684 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:46:36,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:36,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:36,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:36,791 WARN L253 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 14:46:36,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:36,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:36,839 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-19 14:46:36,840 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2051 states and 2411 transitions. cyclomatic complexity: 372 Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:36,876 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2051 states and 2411 transitions. cyclomatic complexity: 372. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 3243 states and 3662 transitions. Complement of second has 6 states. [2024-11-19 14:46:36,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:36,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:36,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2024-11-19 14:46:36,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 62 letters. Loop has 4 letters. [2024-11-19 14:46:36,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:36,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 66 letters. Loop has 4 letters. [2024-11-19 14:46:36,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:36,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 62 letters. Loop has 8 letters. [2024-11-19 14:46:36,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:36,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3243 states and 3662 transitions. [2024-11-19 14:46:36,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 164 [2024-11-19 14:46:36,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3243 states to 2047 states and 2395 transitions. [2024-11-19 14:46:36,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-19 14:46:36,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-19 14:46:36,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2047 states and 2395 transitions. [2024-11-19 14:46:36,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:36,902 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2047 states and 2395 transitions. [2024-11-19 14:46:36,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states and 2395 transitions. [2024-11-19 14:46:36,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 2047. [2024-11-19 14:46:36,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2047 states, 2047 states have (on average 1.1700048851978506) internal successors, (2395), 2046 states have internal predecessors, (2395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:36,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 2047 states and 2395 transitions. [2024-11-19 14:46:36,929 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2047 states and 2395 transitions. [2024-11-19 14:46:36,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:46:36,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 14:46:36,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2024-11-19 14:46:36,930 INFO L87 Difference]: Start difference. First operand 2047 states and 2395 transitions. Second operand has 21 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:37,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:46:37,213 INFO L93 Difference]: Finished difference Result 1055 states and 1219 transitions. [2024-11-19 14:46:37,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1055 states and 1219 transitions. [2024-11-19 14:46:37,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2024-11-19 14:46:37,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1055 states to 925 states and 1075 transitions. [2024-11-19 14:46:37,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-19 14:46:37,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-19 14:46:37,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 925 states and 1075 transitions. [2024-11-19 14:46:37,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:37,222 INFO L218 hiAutomatonCegarLoop]: Abstraction has 925 states and 1075 transitions. [2024-11-19 14:46:37,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states and 1075 transitions. [2024-11-19 14:46:37,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 892. [2024-11-19 14:46:37,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 892 states have (on average 1.1659192825112108) internal successors, (1040), 891 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:37,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1040 transitions. [2024-11-19 14:46:37,234 INFO L240 hiAutomatonCegarLoop]: Abstraction has 892 states and 1040 transitions. [2024-11-19 14:46:37,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 14:46:37,236 INFO L425 stractBuchiCegarLoop]: Abstraction has 892 states and 1040 transitions. [2024-11-19 14:46:37,236 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-19 14:46:37,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 892 states and 1040 transitions. [2024-11-19 14:46:37,239 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2024-11-19 14:46:37,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:37,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:37,240 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 15, 15, 5, 5, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:37,240 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 9, 9, 2, 2, 2, 1, 1, 1] [2024-11-19 14:46:37,241 INFO L745 eck$LassoCheckResult]: Stem: 26717#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 26705#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 26697#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 26698#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 26702#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 26701#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 26699#L33-1 main_~i~0#1 := 0; 26700#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 26720#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 27250#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 27251#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 27252#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 27182#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27253#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27247#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27245#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27242#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 27239#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 27199#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 27198#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 27196#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 27197#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 27180#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27179#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27178#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27177#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27175#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27174#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27173#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27172#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27171#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 27170#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 27169#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 26897#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27161#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27097#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 27081#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27076#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27071#L18 assume !(0 == __VERIFIER_assert_~cond#1); 26948#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 26945#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 26904#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 26903#L18 assume !(0 == __VERIFIER_assert_~cond#1); 26902#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 26901#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 26900#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 26899#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 26896#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 26894#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 26889#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 26887#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 26886#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 26885#L18 assume !(0 == __VERIFIER_assert_~cond#1); 26884#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 26883#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 26882#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 26881#L18 assume !(0 == __VERIFIER_assert_~cond#1); 26880#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 26877#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 26875#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 26850#L18 assume !(0 == __VERIFIER_assert_~cond#1); 26848#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 26845#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 26846#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 26734#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 26810#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 26760#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 26809#L18 assume !(0 == __VERIFIER_assert_~cond#1); 26808#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 26751#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 26750#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 26749#L18 assume !(0 == __VERIFIER_assert_~cond#1); 26748#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 26747#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 26746#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 26745#L18 assume !(0 == __VERIFIER_assert_~cond#1); 26744#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 26743#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 26742#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 26741#L18 assume !(0 == __VERIFIER_assert_~cond#1); 26740#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 26739#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 26738#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 26737#L18 assume !(0 == __VERIFIER_assert_~cond#1); 26736#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 26735#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 26733#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 26731#L18 assume !(0 == __VERIFIER_assert_~cond#1); 26732#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 26798#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 26794#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 26788#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 26759#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 26706#L34-2 [2024-11-19 14:46:37,241 INFO L747 eck$LassoCheckResult]: Loop: 26706#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 26707#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 26864#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 26862#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 26861#L18 assume !(0 == __VERIFIER_assert_~cond#1); 26860#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 26859#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 26858#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 26857#L18 assume !(0 == __VERIFIER_assert_~cond#1); 26856#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 26853#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 26851#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 26849#L18 assume !(0 == __VERIFIER_assert_~cond#1); 26847#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 26843#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 26844#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 26814#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 26756#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 26755#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 26754#L18 assume !(0 == __VERIFIER_assert_~cond#1); 26752#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 26753#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 26807#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 26806#L18 assume !(0 == __VERIFIER_assert_~cond#1); 26805#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 26804#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 26803#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 26802#L18 assume !(0 == __VERIFIER_assert_~cond#1); 26801#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 26797#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 26792#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 26793#L18 assume !(0 == __VERIFIER_assert_~cond#1); 26799#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 26795#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 26789#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 26790#L18 assume !(0 == __VERIFIER_assert_~cond#1); 26800#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 26796#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 26791#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 26728#L18 assume !(0 == __VERIFIER_assert_~cond#1); 26730#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 26729#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 26727#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 26725#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 26726#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 26706#L34-2 [2024-11-19 14:46:37,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:37,242 INFO L85 PathProgramCache]: Analyzing trace with hash 274643133, now seen corresponding path program 7 times [2024-11-19 14:46:37,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:37,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681147262] [2024-11-19 14:46:37,242 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:46:37,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:37,411 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 41 proven. 381 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-19 14:46:37,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:37,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681147262] [2024-11-19 14:46:37,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681147262] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:46:37,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333052661] [2024-11-19 14:46:37,412 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:46:37,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:46:37,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:37,415 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:46:37,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2024-11-19 14:46:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:37,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 14:46:37,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:37,750 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 154 proven. 330 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-19 14:46:37,750 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:46:37,969 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 154 proven. 330 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-19 14:46:37,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333052661] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:46:37,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:46:37,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 27 [2024-11-19 14:46:37,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57434371] [2024-11-19 14:46:37,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:46:37,970 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:46:37,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:37,970 INFO L85 PathProgramCache]: Analyzing trace with hash 492043776, now seen corresponding path program 5 times [2024-11-19 14:46:37,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:37,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374498709] [2024-11-19 14:46:37,971 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:46:37,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:38,003 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-11-19 14:46:38,003 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:38,174 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 79 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:38,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:38,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374498709] [2024-11-19 14:46:38,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374498709] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:46:38,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433219414] [2024-11-19 14:46:38,175 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:46:38,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:46:38,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:38,177 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:46:38,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2024-11-19 14:46:38,236 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-11-19 14:46:38,236 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:38,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 14:46:38,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:38,286 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 83 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:38,286 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:46:38,412 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 83 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:38,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433219414] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:46:38,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:46:38,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 18 [2024-11-19 14:46:38,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103593855] [2024-11-19 14:46:38,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:46:38,413 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:46:38,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:46:38,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 14:46:38,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-19 14:46:38,414 INFO L87 Difference]: Start difference. First operand 892 states and 1040 transitions. cyclomatic complexity: 164 Second operand has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:46:38,622 INFO L93 Difference]: Finished difference Result 1673 states and 1877 transitions. [2024-11-19 14:46:38,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1673 states and 1877 transitions. [2024-11-19 14:46:38,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 164 [2024-11-19 14:46:38,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1673 states to 1673 states and 1877 transitions. [2024-11-19 14:46:38,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-19 14:46:38,633 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-19 14:46:38,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1673 states and 1877 transitions. [2024-11-19 14:46:38,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:38,634 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1673 states and 1877 transitions. [2024-11-19 14:46:38,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states and 1877 transitions. [2024-11-19 14:46:38,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1312. [2024-11-19 14:46:38,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1312 states have (on average 1.138719512195122) internal successors, (1494), 1311 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:38,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1494 transitions. [2024-11-19 14:46:38,652 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1312 states and 1494 transitions. [2024-11-19 14:46:38,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 14:46:38,653 INFO L425 stractBuchiCegarLoop]: Abstraction has 1312 states and 1494 transitions. [2024-11-19 14:46:38,653 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-19 14:46:38,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1312 states and 1494 transitions. [2024-11-19 14:46:38,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 104 [2024-11-19 14:46:38,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:38,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:38,658 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [21, 21, 21, 21, 6, 6, 6, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:38,658 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 21, 21, 21, 4, 4, 4, 2, 2, 2] [2024-11-19 14:46:38,658 INFO L745 eck$LassoCheckResult]: Stem: 30163#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 30152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 30144#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 30145#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 30149#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 30148#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 30146#L33-1 main_~i~0#1 := 0; 30147#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 30428#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 30425#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 30426#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 30427#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 30400#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30423#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30421#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30419#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30417#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 30416#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 30415#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 30414#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 30412#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 30413#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 30397#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30395#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30393#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30391#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30388#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30386#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30384#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30382#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30379#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 30378#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 30377#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 30363#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30376#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30375#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30374#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30373#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30372#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30371#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30370#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30369#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30368#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30367#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30366#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30365#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 30364#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 30362#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 30361#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 30359#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 30351#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 30349#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30347#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30345#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30343#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30341#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30339#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30337#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30335#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30333#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30331#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30329#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30327#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30325#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30324#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30323#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30320#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30319#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 30250#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 30316#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 30314#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30311#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30308#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30305#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30303#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30301#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30298#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30295#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30292#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30288#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30285#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30282#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30279#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30275#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30272#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30269#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30267#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30265#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30263#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30260#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30258#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 30245#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 30257#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 30205#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30206#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30202#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30201#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30200#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30199#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30198#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30197#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30195#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30196#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30192#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30191#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30189#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30187#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30188#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30251#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30249#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30248#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30247#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30246#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30244#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30241#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30243#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30242#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30240#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 30239#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 30211#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 30153#L34-2 [2024-11-19 14:46:38,662 INFO L747 eck$LassoCheckResult]: Loop: 30153#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 30154#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 30166#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 30450#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30449#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30448#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30447#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30446#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30445#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30444#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30443#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30442#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30441#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30440#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30439#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30438#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30437#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30436#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30435#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30411#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 30184#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 30396#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 30394#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30392#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30390#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30387#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30385#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30383#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30381#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30358#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30350#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30348#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30346#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30344#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30342#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30340#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30338#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30336#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30334#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30332#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30330#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30328#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30326#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 30179#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 30238#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 30171#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30237#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30236#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30235#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30234#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30233#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30232#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30231#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30230#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30229#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30228#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30227#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30225#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30224#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30223#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30222#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30221#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30220#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30219#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30218#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30217#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30214#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30216#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30215#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30213#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 30212#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 30169#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 30170#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 30210#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 30209#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 30208#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30203#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30204#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30434#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30433#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30432#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30431#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30430#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30429#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30193#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30194#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30254#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30253#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30252#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30186#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30185#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30183#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30182#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30181#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30180#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30178#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30175#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30177#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 30176#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30174#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 30172#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 30173#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 30153#L34-2 [2024-11-19 14:46:38,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:38,664 INFO L85 PathProgramCache]: Analyzing trace with hash -6331058, now seen corresponding path program 8 times [2024-11-19 14:46:38,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:38,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341722903] [2024-11-19 14:46:38,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:46:38,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:38,689 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:46:38,689 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:38,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1050 backedges. 510 proven. 359 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-19 14:46:38,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:38,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341722903] [2024-11-19 14:46:38,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341722903] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:46:38,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239487800] [2024-11-19 14:46:38,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:46:38,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:46:38,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:38,930 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:46:38,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2024-11-19 14:46:39,013 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:46:39,013 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:39,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:46:39,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:39,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1050 backedges. 551 proven. 147 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2024-11-19 14:46:39,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:46:39,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1050 backedges. 551 proven. 147 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2024-11-19 14:46:39,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239487800] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:46:39,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:46:39,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2024-11-19 14:46:39,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934100728] [2024-11-19 14:46:39,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:46:39,398 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:46:39,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:39,399 INFO L85 PathProgramCache]: Analyzing trace with hash -927504187, now seen corresponding path program 6 times [2024-11-19 14:46:39,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:39,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215509149] [2024-11-19 14:46:39,399 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:46:39,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:39,407 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-11-19 14:46:39,407 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:39,456 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 3 proven. 611 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2024-11-19 14:46:39,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:39,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215509149] [2024-11-19 14:46:39,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215509149] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:46:39,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964866950] [2024-11-19 14:46:39,457 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:46:39,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:46:39,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:39,459 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:46:39,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2024-11-19 14:46:39,515 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-11-19 14:46:39,515 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:39,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 14:46:39,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:39,695 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 298 proven. 316 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2024-11-19 14:46:39,695 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:46:39,892 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 206 proven. 408 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2024-11-19 14:46:39,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964866950] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:46:39,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:46:39,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-19 14:46:39,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648957531] [2024-11-19 14:46:39,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:46:39,894 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:46:39,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:46:39,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 14:46:39,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-11-19 14:46:39,894 INFO L87 Difference]: Start difference. First operand 1312 states and 1494 transitions. cyclomatic complexity: 198 Second operand has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:40,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:46:40,057 INFO L93 Difference]: Finished difference Result 2413 states and 2651 transitions. [2024-11-19 14:46:40,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2413 states and 2651 transitions. [2024-11-19 14:46:40,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 178 [2024-11-19 14:46:40,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2413 states to 1214 states and 1333 transitions. [2024-11-19 14:46:40,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-19 14:46:40,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-19 14:46:40,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1214 states and 1333 transitions. [2024-11-19 14:46:40,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:40,070 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1214 states and 1333 transitions. [2024-11-19 14:46:40,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states and 1333 transitions. [2024-11-19 14:46:40,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 871. [2024-11-19 14:46:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 871 states have (on average 1.1102181400688864) internal successors, (967), 870 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:40,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 967 transitions. [2024-11-19 14:46:40,082 INFO L240 hiAutomatonCegarLoop]: Abstraction has 871 states and 967 transitions. [2024-11-19 14:46:40,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 14:46:40,083 INFO L425 stractBuchiCegarLoop]: Abstraction has 871 states and 967 transitions. [2024-11-19 14:46:40,083 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-19 14:46:40,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 871 states and 967 transitions. [2024-11-19 14:46:40,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 118 [2024-11-19 14:46:40,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:40,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:40,087 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [30, 30, 30, 30, 9, 9, 9, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:40,087 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 15, 15, 3, 3, 3, 1, 1, 1] [2024-11-19 14:46:40,088 INFO L745 eck$LassoCheckResult]: Stem: 35269#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 35257#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 35249#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 35250#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 35254#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 35253#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 35251#L33-1 main_~i~0#1 := 0; 35252#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 35272#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 35337#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 35336#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 35262#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 35263#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35607#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35606#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35605#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35604#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 35602#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 35600#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 35598#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 35596#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 35594#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 35558#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35557#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35556#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35554#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35555#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35552#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35551#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35550#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35549#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 35548#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 35547#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 35533#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35546#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35545#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35544#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35543#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35542#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35541#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35540#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35539#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35538#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35537#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35536#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35535#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 35534#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 35532#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 35531#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 35528#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 35530#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 36055#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 36054#L18 assume !(0 == __VERIFIER_assert_~cond#1); 36053#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 36052#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 36051#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 36050#L18 assume !(0 == __VERIFIER_assert_~cond#1); 36049#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 36048#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 36047#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 36046#L18 assume !(0 == __VERIFIER_assert_~cond#1); 36045#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 36044#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 36042#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 36043#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 36105#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 36103#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 36101#L18 assume !(0 == __VERIFIER_assert_~cond#1); 36099#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 36097#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 36095#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 36093#L18 assume !(0 == __VERIFIER_assert_~cond#1); 36091#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 36089#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 36087#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 36085#L18 assume !(0 == __VERIFIER_assert_~cond#1); 36083#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 36081#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 36078#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 35930#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 35931#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 35923#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35924#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35913#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35914#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35903#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35904#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35893#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35894#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35883#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35884#L18 assume !(0 == __VERIFIER_assert_~cond#1); 36064#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 36063#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35526#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 35524#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 35525#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 35520#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 35521#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 35517#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 35515#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35513#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35511#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35509#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35507#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35505#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35503#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35501#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35499#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35497#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35495#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35493#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35491#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35489#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35487#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35485#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35483#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 35344#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 35481#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 35480#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35478#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35475#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35471#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35467#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35463#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35459#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35455#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35451#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35447#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35443#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35439#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35435#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35431#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35427#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35422#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35343#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35342#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35341#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35340#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35339#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 35338#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 35332#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 35333#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35329#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35330#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35325#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35326#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35321#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35322#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35317#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35318#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35313#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35314#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35309#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35310#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35304#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35305#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35300#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35301#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35295#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35296#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35291#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35292#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35287#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35288#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35283#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35284#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 35278#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 35279#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 35258#L34-2 [2024-11-19 14:46:40,088 INFO L747 eck$LassoCheckResult]: Loop: 35258#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 35259#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 35391#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 35389#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35388#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35387#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35386#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35385#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35384#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35383#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35382#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35381#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35380#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35379#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35378#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35377#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35376#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35375#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35374#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35373#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 35344#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 35481#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 35480#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35478#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35475#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35471#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35467#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35463#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35459#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35455#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35451#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35447#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35443#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35439#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35435#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35431#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35427#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35422#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35343#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35342#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35341#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35340#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35339#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 35338#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 35332#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 35333#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35329#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35330#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35325#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35326#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35321#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35322#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35317#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35318#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35313#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35314#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35309#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35310#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35304#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35305#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35300#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35301#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35295#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35296#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35291#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35292#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 35287#L18 assume !(0 == __VERIFIER_assert_~cond#1); 35288#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 35283#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 35284#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 35278#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 35279#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 35258#L34-2 [2024-11-19 14:46:40,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:40,089 INFO L85 PathProgramCache]: Analyzing trace with hash -991352360, now seen corresponding path program 9 times [2024-11-19 14:46:40,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:40,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691313608] [2024-11-19 14:46:40,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:46:40,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:40,111 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-19 14:46:40,112 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:40,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 1360 proven. 218 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2024-11-19 14:46:40,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:40,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691313608] [2024-11-19 14:46:40,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691313608] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:46:40,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586878232] [2024-11-19 14:46:40,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:46:40,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:46:40,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:40,300 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:46:40,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2024-11-19 14:46:40,381 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-19 14:46:40,381 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:40,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 14:46:40,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:40,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 1563 proven. 15 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2024-11-19 14:46:40,557 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:46:40,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 1373 proven. 205 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2024-11-19 14:46:40,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586878232] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:46:40,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:46:40,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 21 [2024-11-19 14:46:40,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750969954] [2024-11-19 14:46:40,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:46:40,728 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:46:40,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:40,728 INFO L85 PathProgramCache]: Analyzing trace with hash -549720533, now seen corresponding path program 7 times [2024-11-19 14:46:40,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:40,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373514335] [2024-11-19 14:46:40,728 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:46:40,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:40,894 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 15 proven. 351 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-19 14:46:40,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:40,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373514335] [2024-11-19 14:46:40,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373514335] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:46:40,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064707134] [2024-11-19 14:46:40,895 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:46:40,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:46:40,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:40,897 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:46:40,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2024-11-19 14:46:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:40,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:46:40,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 15 proven. 351 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-19 14:46:41,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:46:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 28 proven. 338 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-19 14:46:41,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064707134] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:46:41,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:46:41,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2024-11-19 14:46:41,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118343323] [2024-11-19 14:46:41,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:46:41,404 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:46:41,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:46:41,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 14:46:41,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2024-11-19 14:46:41,405 INFO L87 Difference]: Start difference. First operand 871 states and 967 transitions. cyclomatic complexity: 106 Second operand has 24 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 24 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:41,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:46:41,582 INFO L93 Difference]: Finished difference Result 1909 states and 2096 transitions. [2024-11-19 14:46:41,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1909 states and 2096 transitions. [2024-11-19 14:46:41,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 308 [2024-11-19 14:46:41,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1909 states to 1909 states and 2096 transitions. [2024-11-19 14:46:41,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-19 14:46:41,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-19 14:46:41,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1909 states and 2096 transitions. [2024-11-19 14:46:41,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:41,594 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1909 states and 2096 transitions. [2024-11-19 14:46:41,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1909 states and 2096 transitions. [2024-11-19 14:46:41,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1909 to 1183. [2024-11-19 14:46:41,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1183 states have (on average 1.1081994928148775) internal successors, (1311), 1182 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:41,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1311 transitions. [2024-11-19 14:46:41,616 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1183 states and 1311 transitions. [2024-11-19 14:46:41,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 14:46:41,617 INFO L425 stractBuchiCegarLoop]: Abstraction has 1183 states and 1311 transitions. [2024-11-19 14:46:41,617 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-19 14:46:41,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1183 states and 1311 transitions. [2024-11-19 14:46:41,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 164 [2024-11-19 14:46:41,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:41,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:41,622 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [33, 33, 33, 33, 10, 10, 10, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:41,622 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 18, 18, 18, 4, 4, 4, 1, 1, 1] [2024-11-19 14:46:41,622 INFO L745 eck$LassoCheckResult]: Stem: 39543#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 39529#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 39523#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 39524#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 39528#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 39527#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 39525#L33-1 main_~i~0#1 := 0; 39526#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 39546#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 39557#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 39556#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 39536#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 39537#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39887#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39886#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39885#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39884#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 39883#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 39880#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 39881#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 39888#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 39889#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 39848#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39846#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39844#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39841#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39842#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39836#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39835#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39834#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39833#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 39832#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 39831#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 39817#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39830#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39829#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39828#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39827#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39826#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39825#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39824#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39823#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39822#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39821#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39820#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39819#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 39818#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 39816#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 39815#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 39812#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 39814#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 40671#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40670#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40669#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 40668#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40667#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40666#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40665#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 40664#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40663#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40662#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40661#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 40660#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40659#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 40640#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 39538#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 39539#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40705#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40704#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 40703#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40702#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40701#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40682#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 40680#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40678#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40676#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40674#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 40672#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40673#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 40453#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 40700#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 40699#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40698#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40403#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 40404#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40394#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40395#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40385#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 40386#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40694#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40692#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40690#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 40366#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40367#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 39838#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 39839#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 39807#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 39808#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 39805#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 39800#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39801#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39796#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39797#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39792#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39793#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39788#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39789#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39784#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39785#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39780#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39781#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39776#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 39615#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 40323#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 40322#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40321#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40320#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 40319#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40318#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40317#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40316#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 40315#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40314#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40313#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40312#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 40311#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40310#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40309#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40308#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 40307#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40306#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 39597#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 39936#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 39935#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39933#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39931#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39929#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39927#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39925#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39923#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39921#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39919#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39917#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39915#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39913#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39911#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39909#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39907#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39905#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39596#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39595#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39594#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39593#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39589#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 39587#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 39588#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 39706#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39731#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39730#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39729#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39728#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39727#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39726#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39725#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39724#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39723#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39722#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39721#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39720#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39719#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39718#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39717#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39716#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39715#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39714#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39713#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39712#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39709#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39711#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39710#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39708#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 39552#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 39553#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 39532#L34-2 [2024-11-19 14:46:41,623 INFO L747 eck$LassoCheckResult]: Loop: 39532#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 39533#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 39700#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 39698#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39697#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39696#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39695#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39694#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39693#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39692#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39691#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39690#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39689#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39688#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39687#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39686#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 39615#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 40323#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 40322#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40321#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40320#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 40319#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40318#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40317#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40316#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 40315#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40314#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40313#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40312#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 40311#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40310#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40309#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40308#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 40307#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40306#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 39597#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 39936#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 39935#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39933#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39931#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39929#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39927#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39925#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39923#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39921#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39919#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39917#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39915#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39913#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39911#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39909#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39907#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39905#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39596#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39595#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39594#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39593#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39589#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 39587#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 39588#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 39706#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39731#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39730#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39729#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39728#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39727#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39726#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39725#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39724#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39723#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39722#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39721#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39720#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39719#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39718#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39717#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39716#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39715#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39714#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39713#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39712#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 39709#L18 assume !(0 == __VERIFIER_assert_~cond#1); 39711#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 39710#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 39708#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 39552#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 39553#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 39532#L34-2 [2024-11-19 14:46:41,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:41,623 INFO L85 PathProgramCache]: Analyzing trace with hash -373493117, now seen corresponding path program 10 times [2024-11-19 14:46:41,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:41,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706579004] [2024-11-19 14:46:41,624 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:46:41,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:41,665 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:46:41,665 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:41,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2653 backedges. 1337 proven. 253 refuted. 0 times theorem prover too weak. 1063 trivial. 0 not checked. [2024-11-19 14:46:41,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:41,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706579004] [2024-11-19 14:46:41,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706579004] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:46:41,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142338572] [2024-11-19 14:46:41,889 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:46:41,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:46:41,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:41,891 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:46:41,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2024-11-19 14:46:41,997 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:46:41,997 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:42,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 14:46:42,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:42,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2653 backedges. 1442 proven. 148 refuted. 0 times theorem prover too weak. 1063 trivial. 0 not checked. [2024-11-19 14:46:42,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:46:42,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2653 backedges. 1337 proven. 253 refuted. 0 times theorem prover too weak. 1063 trivial. 0 not checked. [2024-11-19 14:46:42,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142338572] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:46:42,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:46:42,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18 [2024-11-19 14:46:42,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808098340] [2024-11-19 14:46:42,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:46:42,341 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:46:42,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:42,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1901370832, now seen corresponding path program 8 times [2024-11-19 14:46:42,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:42,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580426497] [2024-11-19 14:46:42,342 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:46:42,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:42,364 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:46:42,365 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:42,555 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 388 proven. 209 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-11-19 14:46:42,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:42,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580426497] [2024-11-19 14:46:42,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580426497] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:46:42,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693057881] [2024-11-19 14:46:42,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:46:42,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:46:42,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:42,558 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:46:42,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2024-11-19 14:46:42,639 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:46:42,639 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:42,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:46:42,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:42,901 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 425 proven. 142 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-19 14:46:42,902 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:46:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 552 proven. 15 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-19 14:46:43,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693057881] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:46:43,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:46:43,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 28 [2024-11-19 14:46:43,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379972079] [2024-11-19 14:46:43,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:46:43,121 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:46:43,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:46:43,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 14:46:43,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2024-11-19 14:46:43,122 INFO L87 Difference]: Start difference. First operand 1183 states and 1311 transitions. cyclomatic complexity: 141 Second operand has 28 states, 28 states have (on average 3.7857142857142856) internal successors, (106), 28 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:44,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:46:44,052 INFO L93 Difference]: Finished difference Result 1583 states and 1728 transitions. [2024-11-19 14:46:44,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1583 states and 1728 transitions. [2024-11-19 14:46:44,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 233 [2024-11-19 14:46:44,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1583 states to 1284 states and 1363 transitions. [2024-11-19 14:46:44,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-19 14:46:44,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-19 14:46:44,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1284 states and 1363 transitions. [2024-11-19 14:46:44,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:44,064 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1284 states and 1363 transitions. [2024-11-19 14:46:44,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states and 1363 transitions. [2024-11-19 14:46:44,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1274. [2024-11-19 14:46:44,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1274 states have (on average 1.0620094191522762) internal successors, (1353), 1273 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:44,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1353 transitions. [2024-11-19 14:46:44,078 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1274 states and 1353 transitions. [2024-11-19 14:46:44,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-11-19 14:46:44,079 INFO L425 stractBuchiCegarLoop]: Abstraction has 1274 states and 1353 transitions. [2024-11-19 14:46:44,079 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-19 14:46:44,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1274 states and 1353 transitions. [2024-11-19 14:46:44,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 233 [2024-11-19 14:46:44,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:44,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:44,084 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [37, 37, 37, 37, 10, 10, 9, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:44,084 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 21, 21, 21, 4, 4, 4, 1, 1, 1] [2024-11-19 14:46:44,084 INFO L745 eck$LassoCheckResult]: Stem: 44070#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 44058#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 44050#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 44051#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 44055#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 44054#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 44052#L33-1 main_~i~0#1 := 0; 44053#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 44073#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 44432#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 44431#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 44063#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 44064#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44470#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44469#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44468#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44467#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 44466#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 44465#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 44464#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 44463#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 44462#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 44461#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44460#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44459#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44458#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44457#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44456#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44455#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44454#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44453#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 44452#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 44451#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 44450#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44449#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44448#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44447#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44446#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44445#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44444#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44443#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44442#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44441#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44440#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44439#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44438#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 44437#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 44436#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 44435#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 44428#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 44430#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 45282#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 45280#L18 assume !(0 == __VERIFIER_assert_~cond#1); 45278#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 45276#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 45274#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 45272#L18 assume !(0 == __VERIFIER_assert_~cond#1); 45269#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 45265#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 45261#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 45257#L18 assume !(0 == __VERIFIER_assert_~cond#1); 45253#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 45249#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 45245#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 45241#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 45237#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 45233#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 45229#L18 assume !(0 == __VERIFIER_assert_~cond#1); 45225#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 45221#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 45216#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 45213#L18 assume !(0 == __VERIFIER_assert_~cond#1); 45209#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 45205#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 45201#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 45197#L18 assume !(0 == __VERIFIER_assert_~cond#1); 45193#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 45189#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 45185#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 45183#L18 assume !(0 == __VERIFIER_assert_~cond#1); 45179#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 45175#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 45169#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 45165#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 45162#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 45159#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 45157#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44886#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44887#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 45134#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 45130#L18 assume !(0 == __VERIFIER_assert_~cond#1); 45126#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 45122#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 45118#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 45114#L18 assume !(0 == __VERIFIER_assert_~cond#1); 45110#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 45106#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 45102#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 44479#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 44480#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 44472#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 44473#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 44426#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 44424#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44422#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44420#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44418#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44416#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44414#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44412#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44410#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44408#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44406#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44404#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44402#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44400#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44398#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44396#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44394#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44392#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 44268#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 44389#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 44387#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44385#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44383#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44381#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44379#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44377#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44375#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44373#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44371#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44369#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44367#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44365#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44363#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44361#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44359#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44357#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44355#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44353#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44351#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44349#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44347#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 44240#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 44344#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 44342#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44340#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44338#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44336#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44334#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44332#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44330#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44328#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44326#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44324#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44322#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44320#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44318#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44316#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44314#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44312#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44310#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44308#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44306#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44304#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44302#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44296#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44300#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44298#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44295#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 44205#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 44206#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 44128#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44129#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44124#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44125#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44120#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44121#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44116#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44117#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44112#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44113#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44108#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44109#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44104#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44105#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44100#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44101#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44096#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44097#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44092#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44093#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44089#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44081#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44085#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44086#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44080#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 44082#L35-2 [2024-11-19 14:46:44,085 INFO L747 eck$LassoCheckResult]: Loop: 44082#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 44079#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 44077#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 44289#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 44286#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 44284#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44283#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44282#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44281#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44280#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44279#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44278#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44277#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44276#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44275#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44274#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44273#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44272#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44271#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44270#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44269#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44267#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 44268#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 44389#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 44387#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44385#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44383#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44381#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44379#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44377#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44375#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44373#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44371#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44369#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44367#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44365#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44363#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44361#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44359#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44357#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44355#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44353#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44351#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44349#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44347#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 44240#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 44344#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 44342#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44340#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44338#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44336#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44334#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44332#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44330#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44328#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44326#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44324#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44322#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44320#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44318#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44316#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44314#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44312#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44310#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44308#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44306#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44304#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44302#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44296#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44300#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44298#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44295#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 44205#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 44206#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 44128#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44129#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44124#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44125#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44120#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44121#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44116#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44117#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44112#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44113#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44108#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44109#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44104#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44105#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44100#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44101#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44096#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44097#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44092#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44093#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44089#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 44081#L18 assume !(0 == __VERIFIER_assert_~cond#1); 44085#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 44086#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 44080#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 44082#L35-2 [2024-11-19 14:46:44,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:44,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1116681532, now seen corresponding path program 11 times [2024-11-19 14:46:44,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:44,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015156824] [2024-11-19 14:46:44,086 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:46:44,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:44,159 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2024-11-19 14:46:44,160 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:44,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 1972 proven. 162 refuted. 0 times theorem prover too weak. 1088 trivial. 0 not checked. [2024-11-19 14:46:44,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:44,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015156824] [2024-11-19 14:46:44,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015156824] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:46:44,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554019876] [2024-11-19 14:46:44,384 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:46:44,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:46:44,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:44,387 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:46:44,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2024-11-19 14:46:44,524 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2024-11-19 14:46:44,525 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:44,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 14:46:44,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 1972 proven. 162 refuted. 0 times theorem prover too weak. 1088 trivial. 0 not checked. [2024-11-19 14:46:44,595 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:46:44,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 1972 proven. 162 refuted. 0 times theorem prover too weak. 1088 trivial. 0 not checked. [2024-11-19 14:46:44,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554019876] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:46:44,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:46:44,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 15 [2024-11-19 14:46:44,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295176439] [2024-11-19 14:46:44,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:46:44,699 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:46:44,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:44,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1740161506, now seen corresponding path program 9 times [2024-11-19 14:46:44,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:44,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930326004] [2024-11-19 14:46:44,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:46:44,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:44,721 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-19 14:46:44,722 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:44,927 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 345 proven. 462 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-19 14:46:44,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:44,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930326004] [2024-11-19 14:46:44,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930326004] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:46:44,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9424301] [2024-11-19 14:46:44,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:46:44,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:46:44,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:44,929 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:46:44,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2024-11-19 14:46:45,021 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-19 14:46:45,021 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:45,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 14:46:45,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:45,252 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 345 proven. 462 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-19 14:46:45,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:46:45,602 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 345 proven. 462 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-19 14:46:45,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9424301] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:46:45,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:46:45,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2024-11-19 14:46:45,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741862821] [2024-11-19 14:46:45,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:46:45,603 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:46:45,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:46:45,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 14:46:45,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2024-11-19 14:46:45,603 INFO L87 Difference]: Start difference. First operand 1274 states and 1353 transitions. cyclomatic complexity: 89 Second operand has 25 states, 24 states have (on average 4.333333333333333) internal successors, (104), 25 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:45,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:46:45,929 INFO L93 Difference]: Finished difference Result 1343 states and 1405 transitions. [2024-11-19 14:46:45,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1343 states and 1405 transitions. [2024-11-19 14:46:45,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 247 [2024-11-19 14:46:45,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1343 states to 886 states and 927 transitions. [2024-11-19 14:46:45,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-19 14:46:45,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-19 14:46:45,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 886 states and 927 transitions. [2024-11-19 14:46:45,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:45,935 INFO L218 hiAutomatonCegarLoop]: Abstraction has 886 states and 927 transitions. [2024-11-19 14:46:45,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states and 927 transitions. [2024-11-19 14:46:45,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 868. [2024-11-19 14:46:45,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 868 states have (on average 1.0472350230414746) internal successors, (909), 867 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:45,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 909 transitions. [2024-11-19 14:46:45,944 INFO L240 hiAutomatonCegarLoop]: Abstraction has 868 states and 909 transitions. [2024-11-19 14:46:45,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 14:46:45,945 INFO L425 stractBuchiCegarLoop]: Abstraction has 868 states and 909 transitions. [2024-11-19 14:46:45,945 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-19 14:46:45,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 868 states and 909 transitions. [2024-11-19 14:46:45,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 241 [2024-11-19 14:46:45,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:45,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:45,949 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [40, 40, 40, 40, 10, 10, 9, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:45,949 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [22, 22, 22, 22, 4, 4, 4, 1, 1, 1] [2024-11-19 14:46:45,949 INFO L745 eck$LassoCheckResult]: Stem: 48526#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 48512#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 48506#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 48507#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 48511#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 48510#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 48508#L33-1 main_~i~0#1 := 0; 48509#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 48529#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 48544#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 48541#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 48542#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 48921#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48920#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48919#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48918#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48917#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 48916#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 48915#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 48914#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 48913#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 48912#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 48911#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48910#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48909#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48908#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48907#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48906#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48905#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48904#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48903#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 48902#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 48901#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 48900#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48899#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48898#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48897#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48896#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48895#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48894#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48893#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48892#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48891#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48890#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48889#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48888#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 48887#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 48886#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 48885#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 48883#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 48884#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 49045#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49044#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49043#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49042#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49041#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49040#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49039#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49038#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49037#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49036#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49035#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49034#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49033#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 49032#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 49031#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 49030#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49029#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49028#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49027#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49026#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49025#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49024#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49023#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49022#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49021#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49020#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49019#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49018#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49017#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49016#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49015#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49014#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 49013#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 49012#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 49011#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49010#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49009#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49008#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49007#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49006#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49005#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49004#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49003#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49002#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49001#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 49000#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48999#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48998#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48997#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48996#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48995#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48994#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48993#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48992#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48991#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 48990#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 48989#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 48988#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 48987#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 48986#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 48520#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48985#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48984#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48983#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48982#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48981#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48980#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48979#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48978#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48977#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48976#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48975#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48974#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48973#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48972#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48971#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48970#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 48712#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 48969#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 48968#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48967#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48966#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48965#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48964#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48963#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48962#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48961#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48960#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48959#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48958#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48957#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48956#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48955#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48954#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48953#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48952#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48951#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48950#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48949#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48948#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 48684#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 48947#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 48946#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48945#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48944#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48943#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48942#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48941#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48940#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48939#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48938#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48937#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48936#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48935#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48934#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48933#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48932#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48931#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48930#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48929#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48928#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48927#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48926#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48923#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48925#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48924#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48922#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 48783#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 48578#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 48577#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48576#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48575#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48574#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48573#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48572#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48571#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48570#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48569#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48568#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48567#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48566#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48565#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48564#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48563#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48562#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48561#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48560#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48559#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48558#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48557#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48556#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48555#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48553#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48554#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48737#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48784#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48539#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48540#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 48527#L35-2 [2024-11-19 14:46:45,950 INFO L747 eck$LassoCheckResult]: Loop: 48527#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 48528#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 48515#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 48516#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 48730#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 48728#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48727#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48726#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48725#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48724#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48723#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48722#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48721#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48720#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48719#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48718#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48717#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48716#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48715#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48714#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48713#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48711#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 48712#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 48969#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 48968#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48967#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48966#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48965#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48964#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48963#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48962#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48961#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48960#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48959#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48958#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48957#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48956#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48955#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48954#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48953#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48952#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48951#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48950#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48949#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48948#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 48684#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 48947#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 48946#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48945#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48944#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48943#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48942#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48941#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48940#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48939#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48938#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48937#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48936#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48935#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48934#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48933#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48932#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48931#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48930#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48929#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48928#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48927#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48926#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48923#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48925#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48924#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48922#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 48783#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 48578#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 48577#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48576#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48575#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48574#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48573#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48572#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48571#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48570#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48569#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48568#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48567#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48566#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48565#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48564#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48563#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48562#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48561#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48560#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48559#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48558#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48557#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48556#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48555#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48553#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48554#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48737#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48784#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 48539#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48540#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 48527#L35-2 [2024-11-19 14:46:45,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:45,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1385180812, now seen corresponding path program 12 times [2024-11-19 14:46:45,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:45,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443485891] [2024-11-19 14:46:45,951 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:46:45,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:46,043 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2024-11-19 14:46:46,043 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:46,043 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:46,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:46,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:46,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2014993202, now seen corresponding path program 10 times [2024-11-19 14:46:46,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:46,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406879016] [2024-11-19 14:46:46,104 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:46:46,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:46,128 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:46:46,129 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:46,129 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:46,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:46,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:46,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1493911969, now seen corresponding path program 13 times [2024-11-19 14:46:46,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:46,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530121822] [2024-11-19 14:46:46,152 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:46:46,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:46,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8797 backedges. 5923 proven. 796 refuted. 0 times theorem prover too weak. 2078 trivial. 0 not checked. [2024-11-19 14:46:46,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:46,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530121822] [2024-11-19 14:46:46,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530121822] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:46:46,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023551441] [2024-11-19 14:46:46,625 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:46:46,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:46:46,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:46,628 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:46:46,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2024-11-19 14:46:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:46,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 14:46:46,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:47,144 INFO L134 CoverageAnalysis]: Checked inductivity of 8797 backedges. 5961 proven. 758 refuted. 0 times theorem prover too weak. 2078 trivial. 0 not checked. [2024-11-19 14:46:47,146 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:46:47,419 INFO L134 CoverageAnalysis]: Checked inductivity of 8797 backedges. 5946 proven. 773 refuted. 0 times theorem prover too weak. 2078 trivial. 0 not checked. [2024-11-19 14:46:47,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023551441] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:46:47,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:46:47,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2024-11-19 14:46:47,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659452738] [2024-11-19 14:46:47,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:46:48,711 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:48,711 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:48,712 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:48,712 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:48,712 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:46:48,712 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:48,712 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:48,712 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:48,712 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration15_Loop [2024-11-19 14:46:48,712 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:48,712 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:48,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:48,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:48,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:48,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:48,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:48,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:48,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:48,765 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:48,765 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:46:48,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:48,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:48,767 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:48,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2024-11-19 14:46:48,769 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:48,769 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:48,779 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:48,780 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6#1=0} Honda state: {ULTIMATE.start_main_#t~post6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:48,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2024-11-19 14:46:48,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:48,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:48,791 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:48,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2024-11-19 14:46:48,793 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:48,793 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:48,804 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:48,804 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:48,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:48,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:48,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:48,816 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:48,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2024-11-19 14:46:48,817 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:48,818 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:48,828 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:48,828 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:48,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2024-11-19 14:46:48,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:48,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:48,841 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:48,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2024-11-19 14:46:48,843 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:48,843 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:48,855 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:48,855 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5#1=0} Honda state: {ULTIMATE.start_main_#t~post5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:48,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2024-11-19 14:46:48,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:48,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:48,867 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:48,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2024-11-19 14:46:48,868 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:48,868 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:48,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:48,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:48,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:48,891 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:48,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2024-11-19 14:46:48,892 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:46:48,892 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:49,025 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:46:49,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:49,030 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:49,030 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:49,030 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:49,030 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:49,030 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:46:49,030 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:49,030 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:49,030 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:49,031 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration15_Loop [2024-11-19 14:46:49,031 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:49,031 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:49,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:49,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:49,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:49,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:49,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:49,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:49,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:49,091 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:49,091 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:46:49,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:49,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:49,093 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:49,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2024-11-19 14:46:49,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:49,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:49,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:49,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:49,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:49,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:49,107 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:49,107 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:49,110 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:46:49,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:49,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:49,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:49,121 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:49,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2024-11-19 14:46:49,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:49,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:49,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:49,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:49,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:49,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:49,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:49,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:49,134 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:46:49,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2024-11-19 14:46:49,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:49,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:49,145 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:49,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2024-11-19 14:46:49,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:49,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:49,156 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:49,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:49,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:49,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:49,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:49,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:49,158 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:46:49,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2024-11-19 14:46:49,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:49,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:49,169 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:49,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2024-11-19 14:46:49,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:49,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:49,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:49,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:49,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:49,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:49,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:49,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:49,184 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:46:49,186 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:46:49,186 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:46:49,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:49,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:49,188 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:49,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2024-11-19 14:46:49,189 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:46:49,189 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:46:49,189 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:46:49,189 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 7 Supporting invariants [] [2024-11-19 14:46:49,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:49,199 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:46:49,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:49,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:49,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:49,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:46:49,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:49,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:49,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 7 proven. 352 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2024-11-19 14:46:49,873 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2024-11-19 14:46:49,873 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 868 states and 909 transitions. cyclomatic complexity: 48 Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:50,007 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 868 states and 909 transitions. cyclomatic complexity: 48. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2285 states and 2390 transitions. Complement of second has 18 states. [2024-11-19 14:46:50,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:50,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2024-11-19 14:46:50,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 59 transitions. Stem has 209 letters. Loop has 103 letters. [2024-11-19 14:46:50,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:50,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 59 transitions. Stem has 312 letters. Loop has 103 letters. [2024-11-19 14:46:50,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:50,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 59 transitions. Stem has 209 letters. Loop has 206 letters. [2024-11-19 14:46:50,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:50,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2285 states and 2390 transitions. [2024-11-19 14:46:50,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2024-11-19 14:46:50,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2285 states to 1664 states and 1745 transitions. [2024-11-19 14:46:50,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-19 14:46:50,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-19 14:46:50,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1664 states and 1745 transitions. [2024-11-19 14:46:50,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:50,027 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1664 states and 1745 transitions. [2024-11-19 14:46:50,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states and 1745 transitions. [2024-11-19 14:46:50,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1409. [2024-11-19 14:46:50,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1409 states have (on average 1.0518097941802698) internal successors, (1482), 1408 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:50,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 1482 transitions. [2024-11-19 14:46:50,047 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1409 states and 1482 transitions. [2024-11-19 14:46:50,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:46:50,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 14:46:50,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2024-11-19 14:46:50,048 INFO L87 Difference]: Start difference. First operand 1409 states and 1482 transitions. Second operand has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 21 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:50,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:46:50,291 INFO L93 Difference]: Finished difference Result 2123 states and 2205 transitions. [2024-11-19 14:46:50,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2123 states and 2205 transitions. [2024-11-19 14:46:50,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2024-11-19 14:46:50,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2123 states to 705 states and 728 transitions. [2024-11-19 14:46:50,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-19 14:46:50,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-19 14:46:50,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 705 states and 728 transitions. [2024-11-19 14:46:50,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:50,299 INFO L218 hiAutomatonCegarLoop]: Abstraction has 705 states and 728 transitions. [2024-11-19 14:46:50,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states and 728 transitions. [2024-11-19 14:46:50,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 622. [2024-11-19 14:46:50,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 622 states have (on average 1.0337620578778135) internal successors, (643), 621 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:50,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 643 transitions. [2024-11-19 14:46:50,305 INFO L240 hiAutomatonCegarLoop]: Abstraction has 622 states and 643 transitions. [2024-11-19 14:46:50,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 14:46:50,306 INFO L425 stractBuchiCegarLoop]: Abstraction has 622 states and 643 transitions. [2024-11-19 14:46:50,306 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-19 14:46:50,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 622 states and 643 transitions. [2024-11-19 14:46:50,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 218 [2024-11-19 14:46:50,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:50,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:50,310 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [40, 40, 40, 40, 10, 10, 9, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:50,310 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [23, 23, 23, 23, 4, 4, 4, 1, 1, 1] [2024-11-19 14:46:50,310 INFO L745 eck$LassoCheckResult]: Stem: 58098#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 58087#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 58079#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 58080#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 58084#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 58083#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 58081#L33-1 main_~i~0#1 := 0; 58082#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 58103#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 58252#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 58110#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 58111#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 58251#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58250#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58249#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58248#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58247#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 58246#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 58245#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 58244#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 58243#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 58242#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 58241#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58240#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58239#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58238#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58237#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58236#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58235#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58234#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58233#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 58232#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 58231#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 58230#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58229#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58228#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58227#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58226#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58225#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58224#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58223#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58222#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58221#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58220#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58219#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58218#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 58217#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 58216#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 58215#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 58213#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 58214#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 58621#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58619#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58617#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58615#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58613#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58611#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58609#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58607#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58605#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58603#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58601#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58599#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58596#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 58594#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 58592#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 58590#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58588#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58586#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58584#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58582#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58581#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58579#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58577#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58574#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58572#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58570#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58568#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58566#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58564#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58562#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58560#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58558#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 58556#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 58554#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 58552#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58550#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58548#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58546#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58544#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58542#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58540#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58538#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58536#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58534#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58532#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58530#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58528#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58526#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58524#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58522#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58519#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58520#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58512#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58513#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58507#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 58504#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 58505#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 58499#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 58500#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 58094#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 58085#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58086#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58097#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58095#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58096#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58700#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58699#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58698#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58697#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58696#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58695#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58694#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58693#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58692#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58691#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58690#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58668#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 58101#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 58102#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 58689#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58688#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58687#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58686#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58685#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58684#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58683#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58682#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58681#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58680#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58679#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58678#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58677#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58676#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58675#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58674#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58673#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58672#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58671#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58670#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58669#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 58389#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 58667#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 58666#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58665#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58664#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58663#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58662#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58661#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58660#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58659#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58658#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58657#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58656#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58655#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58654#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58653#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58652#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58517#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58514#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58511#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58508#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58506#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58503#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58418#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58498#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58419#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58417#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 58415#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 58281#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 58279#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58278#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58277#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58276#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58275#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58274#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58273#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58272#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58271#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58270#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58269#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58268#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58267#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58266#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58265#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58264#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58263#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58262#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58261#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58260#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58259#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58258#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58257#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58256#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58255#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58108#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58254#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58253#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58107#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 58109#L35-2 [2024-11-19 14:46:50,311 INFO L747 eck$LassoCheckResult]: Loop: 58109#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 58104#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 58088#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 58089#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 58092#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 58093#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58435#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58434#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58433#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58432#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58431#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58430#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58429#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58428#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58427#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58426#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58425#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58424#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58423#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58422#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58421#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58420#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58413#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58416#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58414#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58412#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 58411#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 58410#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 58409#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58408#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58407#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58406#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58405#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58404#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58403#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58402#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58401#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58400#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58399#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58398#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58397#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58396#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58395#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58394#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58393#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58392#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58391#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58390#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58388#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 58389#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 58667#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 58666#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58665#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58664#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58663#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58662#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58661#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58660#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58659#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58658#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58657#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58656#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58655#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58654#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58653#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58652#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58517#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58514#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58511#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58508#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58506#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58503#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58418#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58498#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58419#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58417#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 58415#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 58281#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 58279#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58278#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58277#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58276#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58275#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58274#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58273#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58272#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58271#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58270#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58269#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58268#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58267#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58266#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58265#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58264#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58263#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58262#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58261#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58260#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58259#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58258#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58257#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58256#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58255#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58108#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58254#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 58253#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58107#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 58109#L35-2 [2024-11-19 14:46:50,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:50,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1385180812, now seen corresponding path program 14 times [2024-11-19 14:46:50,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:50,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270491261] [2024-11-19 14:46:50,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:46:50,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:50,358 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:46:50,359 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:50,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:50,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:50,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:50,406 INFO L85 PathProgramCache]: Analyzing trace with hash -2146004894, now seen corresponding path program 11 times [2024-11-19 14:46:50,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:50,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10530140] [2024-11-19 14:46:50,406 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:46:50,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:50,444 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-11-19 14:46:50,447 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:50,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 611 proven. 173 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-11-19 14:46:50,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:50,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10530140] [2024-11-19 14:46:50,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10530140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:46:50,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669918746] [2024-11-19 14:46:50,633 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:46:50,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:46:50,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:50,635 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:46:50,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2024-11-19 14:46:50,751 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-11-19 14:46:50,752 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:50,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 14:46:50,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:50,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 611 proven. 173 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-11-19 14:46:50,816 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:46:50,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 611 proven. 173 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-11-19 14:46:50,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669918746] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:46:50,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:46:50,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2024-11-19 14:46:50,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711277226] [2024-11-19 14:46:50,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:46:50,931 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:46:50,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:46:50,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 14:46:50,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-19 14:46:50,931 INFO L87 Difference]: Start difference. First operand 622 states and 643 transitions. cyclomatic complexity: 26 Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:51,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:46:51,115 INFO L93 Difference]: Finished difference Result 622 states and 642 transitions. [2024-11-19 14:46:51,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 622 states and 642 transitions. [2024-11-19 14:46:51,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 189 [2024-11-19 14:46:51,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 622 states to 622 states and 642 transitions. [2024-11-19 14:46:51,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-19 14:46:51,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-19 14:46:51,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 622 states and 642 transitions. [2024-11-19 14:46:51,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:51,119 INFO L218 hiAutomatonCegarLoop]: Abstraction has 622 states and 642 transitions. [2024-11-19 14:46:51,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states and 642 transitions. [2024-11-19 14:46:51,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2024-11-19 14:46:51,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 622 states have (on average 1.0321543408360128) internal successors, (642), 621 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:51,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 642 transitions. [2024-11-19 14:46:51,126 INFO L240 hiAutomatonCegarLoop]: Abstraction has 622 states and 642 transitions. [2024-11-19 14:46:51,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 14:46:51,127 INFO L425 stractBuchiCegarLoop]: Abstraction has 622 states and 642 transitions. [2024-11-19 14:46:51,127 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-11-19 14:46:51,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 622 states and 642 transitions. [2024-11-19 14:46:51,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 189 [2024-11-19 14:46:51,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:51,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:51,130 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [40, 40, 40, 40, 10, 10, 9, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:51,130 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [31, 31, 31, 31, 5, 5, 5, 1, 1, 1] [2024-11-19 14:46:51,130 INFO L745 eck$LassoCheckResult]: Stem: 60024#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 60011#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 60003#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 60004#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 60008#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 60007#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 60005#L33-1 main_~i~0#1 := 0; 60006#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 60036#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 60012#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 60013#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 60016#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 60017#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60420#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60418#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60416#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60414#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 60412#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 60410#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 60408#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 60406#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 60404#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 60402#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60400#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60398#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60396#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60394#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60392#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60390#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60388#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60386#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 60385#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 60383#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 60381#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60378#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60376#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60374#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60372#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60370#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60368#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60366#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60364#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60362#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60360#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60358#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60356#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 60354#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 60352#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 60350#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 60348#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 60018#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 60019#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60022#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60023#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60020#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60021#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60621#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60619#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60617#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60615#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60613#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60611#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60609#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60606#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 60607#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 60624#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 60009#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60010#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60623#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60622#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60620#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60618#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60616#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60614#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60612#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60610#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60608#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60605#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60603#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60601#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60599#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60597#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60595#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 60593#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 60591#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 60589#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60587#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60585#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60583#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60581#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60579#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60577#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60575#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60573#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60571#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60569#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60567#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60565#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60563#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60561#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60559#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60557#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60555#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60553#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60551#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60549#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 60547#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 60545#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 60543#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 60541#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 60267#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 60265#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60263#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60262#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60260#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60258#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60255#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60253#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60251#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60250#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60248#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60246#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60244#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60242#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60240#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60238#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60236#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60234#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 60232#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 60230#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 60228#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60226#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60224#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60222#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60220#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60218#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60216#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60214#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60212#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60210#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60208#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60206#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60204#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60202#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60200#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60198#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60196#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60193#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60191#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60188#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60185#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 60182#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 60179#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 60176#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60173#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60170#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60167#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60164#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60161#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60158#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60155#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60152#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60149#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60146#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60143#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60140#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60137#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60134#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60131#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60128#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60125#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60122#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60119#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60116#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60106#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60113#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60110#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60105#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 60101#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 60098#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 60095#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60093#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60091#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60089#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60087#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60085#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60083#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60081#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60079#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60077#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60075#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60073#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60071#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60069#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60067#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60065#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60063#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60061#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60059#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60057#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60055#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60053#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60051#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60049#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60047#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60038#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60045#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60043#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60037#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 60039#L35-2 [2024-11-19 14:46:51,131 INFO L747 eck$LassoCheckResult]: Loop: 60039#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 60040#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 60034#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 60029#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 60030#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 60419#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60417#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60415#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60413#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60411#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60409#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60407#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60405#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60403#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60401#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60399#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60397#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60395#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60393#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60391#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60389#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60387#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60380#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60384#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60382#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60379#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 60377#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 60375#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 60373#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60371#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60369#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60367#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60365#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60363#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60361#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60359#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60357#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60355#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60353#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60351#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60349#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60347#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60345#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60343#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60341#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60339#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60337#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60335#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60333#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60326#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60330#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60328#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60325#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 60323#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 60321#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 60319#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60317#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60315#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60313#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60311#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60309#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60307#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60305#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60303#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60301#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60299#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60297#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60295#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60293#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60291#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60289#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60287#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60285#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60283#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60281#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60279#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60277#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60275#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60273#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60271#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 60027#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 60028#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 60187#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60184#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60181#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60178#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60175#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60172#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60169#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60166#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60163#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60160#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60157#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60154#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60151#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60148#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60145#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60142#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60139#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60136#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60133#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60130#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60127#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60124#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60121#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60118#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60115#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60104#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60112#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60109#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60103#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 60100#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 60097#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 60095#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60093#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60091#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60089#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60087#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60085#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60083#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60081#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60079#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60077#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60075#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60073#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60071#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60069#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60067#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60065#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60063#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60061#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60059#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60057#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60055#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60053#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60051#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60049#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60047#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 60038#L18 assume !(0 == __VERIFIER_assert_~cond#1); 60045#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 60043#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 60037#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 60039#L35-2 [2024-11-19 14:46:51,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:51,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1385180812, now seen corresponding path program 15 times [2024-11-19 14:46:51,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:51,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424075929] [2024-11-19 14:46:51,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:46:51,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:51,176 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2024-11-19 14:46:51,176 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:51,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:51,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:51,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:51,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1336796747, now seen corresponding path program 12 times [2024-11-19 14:46:51,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:51,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197053818] [2024-11-19 14:46:51,219 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:46:51,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:51,254 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2024-11-19 14:46:51,254 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:51,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2050 backedges. 963 proven. 819 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-19 14:46:51,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:51,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197053818] [2024-11-19 14:46:51,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197053818] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:46:51,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530694863] [2024-11-19 14:46:51,505 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:46:51,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:46:51,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:51,507 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:46:51,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2024-11-19 14:46:51,648 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2024-11-19 14:46:51,649 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:51,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 14:46:51,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:51,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2050 backedges. 1362 proven. 244 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2024-11-19 14:46:51,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:46:52,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2050 backedges. 1362 proven. 244 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2024-11-19 14:46:52,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530694863] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:46:52,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:46:52,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 17] total 24 [2024-11-19 14:46:52,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296391163] [2024-11-19 14:46:52,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:46:52,005 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:46:52,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:46:52,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 14:46:52,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2024-11-19 14:46:52,006 INFO L87 Difference]: Start difference. First operand 622 states and 642 transitions. cyclomatic complexity: 26 Second operand has 24 states, 24 states have (on average 4.541666666666667) internal successors, (109), 24 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:53,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:46:53,457 INFO L93 Difference]: Finished difference Result 772 states and 796 transitions. [2024-11-19 14:46:53,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 772 states and 796 transitions. [2024-11-19 14:46:53,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 309 [2024-11-19 14:46:53,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 772 states to 772 states and 796 transitions. [2024-11-19 14:46:53,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-19 14:46:53,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-19 14:46:53,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 772 states and 796 transitions. [2024-11-19 14:46:53,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:53,461 INFO L218 hiAutomatonCegarLoop]: Abstraction has 772 states and 796 transitions. [2024-11-19 14:46:53,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states and 796 transitions. [2024-11-19 14:46:53,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 681. [2024-11-19 14:46:53,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 681 states have (on average 1.0293685756240822) internal successors, (701), 680 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:53,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 701 transitions. [2024-11-19 14:46:53,470 INFO L240 hiAutomatonCegarLoop]: Abstraction has 681 states and 701 transitions. [2024-11-19 14:46:53,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-11-19 14:46:53,470 INFO L425 stractBuchiCegarLoop]: Abstraction has 681 states and 701 transitions. [2024-11-19 14:46:53,470 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-11-19 14:46:53,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 681 states and 701 transitions. [2024-11-19 14:46:53,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 248 [2024-11-19 14:46:53,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:53,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:53,474 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [40, 40, 40, 40, 10, 10, 9, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:53,474 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [34, 34, 34, 34, 5, 5, 5, 1, 1, 1] [2024-11-19 14:46:53,474 INFO L745 eck$LassoCheckResult]: Stem: 62431#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 62418#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 62412#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 62413#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 62417#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 62416#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 62414#L33-1 main_~i~0#1 := 0; 62415#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 62440#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 62441#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 62436#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 62437#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 62583#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62582#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62581#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62580#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62579#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 62578#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 62577#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 62576#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 62575#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 62574#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 62573#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62572#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62571#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62570#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62569#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62568#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62567#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62566#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62565#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 62564#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 62563#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 62562#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62561#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62560#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62559#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62558#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62557#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62556#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62555#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62554#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62553#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62552#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62551#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62550#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 62549#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 62548#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 62547#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 62545#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 62546#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 62761#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62760#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62759#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62758#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62757#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62756#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62755#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62754#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62753#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62752#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62751#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62750#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62748#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 62747#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 62746#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 62745#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62744#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62743#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62742#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62741#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62740#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62739#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62738#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62737#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62736#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62735#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62734#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62733#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62732#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62731#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62730#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62729#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 62728#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 62727#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 62726#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62725#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62724#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62723#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62722#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62721#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62720#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62719#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62718#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62717#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62716#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62715#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62714#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62713#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62712#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62711#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62710#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62709#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62708#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62707#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62706#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 62705#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 62701#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 62696#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 62697#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 62692#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 62691#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62690#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62689#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62688#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62687#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62686#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62685#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62684#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62683#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62682#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62681#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62680#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62679#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62678#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62677#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62676#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62675#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 62674#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 62673#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 62672#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62671#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62670#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62669#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62668#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62667#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62666#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62665#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62664#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62663#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62662#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62661#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62660#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62659#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62658#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62657#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62656#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62655#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62654#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62653#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62652#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 62651#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 62650#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 62649#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62648#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62647#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62646#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62645#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62644#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62643#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62642#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62641#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62640#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62639#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62638#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62637#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62636#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62635#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62634#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62633#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62632#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62630#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62628#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62626#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62619#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62623#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62621#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62618#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 62616#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 62614#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 62612#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62611#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62610#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62609#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62608#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62607#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62606#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62605#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62604#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62603#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62602#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62601#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62600#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62599#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62598#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62597#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62596#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62595#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62594#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62593#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62592#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62591#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62590#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62589#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62588#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62585#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62587#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62586#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62584#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 62444#L35-2 [2024-11-19 14:46:53,475 INFO L747 eck$LassoCheckResult]: Loop: 62444#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 62445#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 62421#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 62422#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 62425#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 62426#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63037#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63036#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63035#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63034#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63033#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63032#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63031#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63030#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63029#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63028#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63027#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63026#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63025#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63024#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63023#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63021#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63022#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63092#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63091#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63090#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 63089#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 62427#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 62419#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62420#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62429#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62430#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63085#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63084#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63083#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63082#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63081#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63080#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63079#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63078#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63077#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63076#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63075#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63074#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63073#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63072#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63071#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63070#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63020#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 63010#L18 assume !(0 == __VERIFIER_assert_~cond#1); 63017#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 63014#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 63009#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 62997#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 62995#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 62993#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62991#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62989#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62987#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62985#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62983#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62981#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62979#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62977#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62975#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62973#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62971#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62969#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62967#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62965#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62963#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62961#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62959#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62957#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62955#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62953#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62950#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62948#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62947#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62945#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62943#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62941#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62939#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62936#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 62934#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 62932#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 62930#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62929#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62928#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62927#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62926#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62925#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62924#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62923#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62922#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62921#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62920#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62919#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62918#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62917#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62916#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62915#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62914#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62913#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62912#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62911#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62910#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62773#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62770#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62767#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62764#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62699#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62704#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62700#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62698#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 62631#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 62629#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 62627#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62625#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62624#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62622#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62620#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62617#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62615#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62613#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62612#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62611#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62610#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62609#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62608#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62607#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62606#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62605#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62604#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62603#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62602#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62601#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62600#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62599#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62598#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62597#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62596#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62595#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62594#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62593#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62592#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62591#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62590#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62589#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62588#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 62585#L18 assume !(0 == __VERIFIER_assert_~cond#1); 62587#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 62586#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 62584#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 62444#L35-2 [2024-11-19 14:46:53,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:53,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1385180812, now seen corresponding path program 16 times [2024-11-19 14:46:53,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:53,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687189379] [2024-11-19 14:46:53,476 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:46:53,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:53,532 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:46:53,532 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:53,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:53,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:53,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:53,582 INFO L85 PathProgramCache]: Analyzing trace with hash 7203003, now seen corresponding path program 13 times [2024-11-19 14:46:53,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:53,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484861721] [2024-11-19 14:46:53,582 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:46:53,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:53,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 1450 proven. 644 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2024-11-19 14:46:53,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:53,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484861721] [2024-11-19 14:46:53,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484861721] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:46:53,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152461820] [2024-11-19 14:46:53,894 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:46:53,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:46:53,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:53,896 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:46:53,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2024-11-19 14:46:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:54,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 14:46:54,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 1253 proven. 885 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2024-11-19 14:46:54,398 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:46:54,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 1253 proven. 885 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2024-11-19 14:46:54,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152461820] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:46:54,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:46:54,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 19] total 33 [2024-11-19 14:46:54,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037267945] [2024-11-19 14:46:54,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:46:54,738 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:46:54,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:46:54,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-19 14:46:54,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 14:46:54,739 INFO L87 Difference]: Start difference. First operand 681 states and 701 transitions. cyclomatic complexity: 26 Second operand has 33 states, 33 states have (on average 4.0) internal successors, (132), 33 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:56,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:46:56,605 INFO L93 Difference]: Finished difference Result 768 states and 790 transitions. [2024-11-19 14:46:56,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 768 states and 790 transitions. [2024-11-19 14:46:56,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 269 [2024-11-19 14:46:56,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 768 states to 768 states and 790 transitions. [2024-11-19 14:46:56,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-19 14:46:56,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-11-19 14:46:56,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 768 states and 790 transitions. [2024-11-19 14:46:56,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:56,611 INFO L218 hiAutomatonCegarLoop]: Abstraction has 768 states and 790 transitions. [2024-11-19 14:46:56,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states and 790 transitions. [2024-11-19 14:46:56,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 646. [2024-11-19 14:46:56,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 646 states have (on average 1.0278637770897834) internal successors, (664), 645 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 664 transitions. [2024-11-19 14:46:56,618 INFO L240 hiAutomatonCegarLoop]: Abstraction has 646 states and 664 transitions. [2024-11-19 14:46:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-11-19 14:46:56,619 INFO L425 stractBuchiCegarLoop]: Abstraction has 646 states and 664 transitions. [2024-11-19 14:46:56,620 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-11-19 14:46:56,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 646 states and 664 transitions. [2024-11-19 14:46:56,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 213 [2024-11-19 14:46:56,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:56,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:56,623 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [40, 40, 40, 40, 10, 10, 9, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:56,623 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [35, 35, 35, 35, 5, 5, 5, 1, 1, 1] [2024-11-19 14:46:56,623 INFO L745 eck$LassoCheckResult]: Stem: 65006#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 64994#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 64986#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 64987#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 64991#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 64990#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 64988#L33-1 main_~i~0#1 := 0; 64989#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 65015#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 65016#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 65011#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 65012#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 65168#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65167#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65166#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65165#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65164#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 65163#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 65162#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 65161#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 65160#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 65159#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 65158#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65157#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65156#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65155#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65154#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65153#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65152#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65151#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65150#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 65149#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 65148#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 65147#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65146#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65145#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65144#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65143#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65142#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65141#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65140#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65139#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65138#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65137#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65136#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65135#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 65134#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 65133#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 65132#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 65130#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 65131#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 65540#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65539#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65538#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65537#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65536#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65535#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65534#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65533#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65532#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65531#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65530#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65529#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65527#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 65526#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 65525#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 65524#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65523#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65522#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65521#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65520#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65519#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65518#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65517#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65516#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65515#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65514#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65513#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65512#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65511#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65510#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65509#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65508#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 65507#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 65506#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 65505#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65504#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65503#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65502#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65501#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65500#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65499#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65498#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65497#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65496#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65495#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65494#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65493#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65492#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65491#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65490#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65489#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65488#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65487#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65486#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65485#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 65484#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 65483#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 65482#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 65481#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 65276#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 65275#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65274#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65273#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65272#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65271#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65270#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65269#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65268#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65267#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65266#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65265#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65264#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65263#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65262#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65261#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65260#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65259#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 65258#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 65257#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 65256#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65255#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65254#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65253#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65252#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65251#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65250#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65249#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65248#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65247#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65246#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65245#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65244#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65243#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65242#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65241#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65240#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65239#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65238#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65237#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65236#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 65235#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 65234#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 65233#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65232#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65231#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65230#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65229#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65228#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65227#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65226#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65225#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65224#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65223#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65222#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65221#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65220#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65219#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65218#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65217#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65216#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65215#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65214#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65213#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65203#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65211#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65205#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65202#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 65200#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 65198#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 65196#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65195#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65194#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65193#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65192#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65191#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65190#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65189#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65188#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65187#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65186#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65185#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65184#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65183#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65182#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65181#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65180#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65179#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65178#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65177#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65176#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65175#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65174#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65173#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65172#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65032#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65169#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65034#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65031#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 65026#L35-2 [2024-11-19 14:46:56,624 INFO L747 eck$LassoCheckResult]: Loop: 65026#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 65027#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 64995#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 64996#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 64999#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 65000#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65418#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65417#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65416#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65415#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65414#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65413#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65412#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65411#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65410#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65409#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65408#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65407#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65406#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65405#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65403#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65401#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65399#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65397#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65395#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65392#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 65390#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 65388#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 65385#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65383#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65381#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65379#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65377#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65375#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65373#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65371#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65369#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65367#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65365#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65363#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65361#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65359#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65357#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65355#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65353#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65351#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65349#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65347#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65345#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65342#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65344#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65343#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65341#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 65340#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 65339#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 65338#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65337#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65336#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65335#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65334#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65333#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65332#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65331#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65330#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65329#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65328#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65327#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65326#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65325#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65324#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65323#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65322#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65321#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65320#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65319#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65318#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65317#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65316#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65315#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65314#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65313#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65312#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65311#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65309#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 65308#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 65307#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 65306#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65305#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65304#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65303#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65302#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65301#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65300#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65299#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65298#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65297#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65296#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65295#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65294#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65293#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65292#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65291#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65290#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65289#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65288#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65287#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65286#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65285#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65284#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65283#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65282#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65281#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65280#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65279#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65278#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65210#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65212#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65024#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65025#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 65019#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 65020#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 65209#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65208#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65207#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65206#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65204#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65201#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65199#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65197#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65196#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65195#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65194#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65193#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65192#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65191#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65190#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65189#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65188#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65187#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65186#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65185#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65184#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65183#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65182#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65181#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65180#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65179#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65178#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65177#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65176#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65175#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65174#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65173#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65172#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65032#L18 assume !(0 == __VERIFIER_assert_~cond#1); 65169#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 65034#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 65031#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 65026#L35-2 [2024-11-19 14:46:56,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:56,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1385180812, now seen corresponding path program 17 times [2024-11-19 14:46:56,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:56,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203473275] [2024-11-19 14:46:56,624 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:46:56,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:56,676 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2024-11-19 14:46:56,677 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:56,677 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:56,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:56,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:56,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1904211307, now seen corresponding path program 14 times [2024-11-19 14:46:56,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:56,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807284295] [2024-11-19 14:46:56,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:46:56,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:56,741 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:46:56,742 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:56,742 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:56,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:56,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:56,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1687696482, now seen corresponding path program 18 times [2024-11-19 14:46:56,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:56,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915133822] [2024-11-19 14:46:56,767 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:46:56,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:56,896 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 30 check-sat command(s) [2024-11-19 14:46:56,896 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:56,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:56,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:59,569 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:59,570 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:59,570 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:59,570 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:59,570 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:46:59,570 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:59,570 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:59,570 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:59,570 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration19_Loop [2024-11-19 14:46:59,570 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:59,570 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:59,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:59,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:59,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:59,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:59,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:59,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:59,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:59,618 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:59,618 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:46:59,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:59,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:59,620 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:59,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2024-11-19 14:46:59,621 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:59,621 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:59,632 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:59,632 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:59,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:59,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:59,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:59,644 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:59,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2024-11-19 14:46:59,645 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:59,645 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:59,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:59,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:59,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:59,667 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:59,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2024-11-19 14:46:59,668 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:46:59,668 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:59,866 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:46:59,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:59,871 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:59,871 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:59,871 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:59,871 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:59,871 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:46:59,871 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:59,871 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:59,871 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:59,871 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration19_Loop [2024-11-19 14:46:59,871 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:59,872 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:59,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:59,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:59,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:59,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:59,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:59,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:59,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:59,921 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:59,921 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:46:59,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:59,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:59,923 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:59,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2024-11-19 14:46:59,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:59,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:59,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:59,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:59,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:59,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:59,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:59,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:59,938 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:46:59,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2024-11-19 14:46:59,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:59,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:59,949 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:59,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2024-11-19 14:46:59,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:46:59,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:59,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:59,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:59,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:59,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:59,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:59,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:59,963 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:46:59,965 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:46:59,965 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:46:59,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:59,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:59,966 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:59,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2024-11-19 14:46:59,968 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:46:59,968 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:46:59,968 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:46:59,968 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 9 Supporting invariants [] [2024-11-19 14:46:59,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2024-11-19 14:46:59,978 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:46:59,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:00,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:47:00,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:00,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 14:47:00,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:00,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2024-11-19 14:47:00,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2590 backedges. 9 proven. 703 refuted. 0 times theorem prover too weak. 1878 trivial. 0 not checked. [2024-11-19 14:47:00,878 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 10 loop predicates [2024-11-19 14:47:00,879 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 646 states and 664 transitions. cyclomatic complexity: 24 Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:01,043 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 646 states and 664 transitions. cyclomatic complexity: 24. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2163 states and 2237 transitions. Complement of second has 20 states. [2024-11-19 14:47:01,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2024-11-19 14:47:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:01,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2024-11-19 14:47:01,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 64 transitions. Stem has 209 letters. Loop has 158 letters. [2024-11-19 14:47:01,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:01,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 64 transitions. Stem has 367 letters. Loop has 158 letters. [2024-11-19 14:47:01,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:01,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 64 transitions. Stem has 209 letters. Loop has 316 letters. [2024-11-19 14:47:01,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:01,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2163 states and 2237 transitions. [2024-11-19 14:47:01,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 238 [2024-11-19 14:47:01,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2163 states to 1851 states and 1919 transitions. [2024-11-19 14:47:01,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-19 14:47:01,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-19 14:47:01,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1851 states and 1919 transitions. [2024-11-19 14:47:01,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:47:01,065 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1851 states and 1919 transitions. [2024-11-19 14:47:01,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states and 1919 transitions. [2024-11-19 14:47:01,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1235. [2024-11-19 14:47:01,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1235 states have (on average 1.0356275303643725) internal successors, (1279), 1234 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:01,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1279 transitions. [2024-11-19 14:47:01,082 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1235 states and 1279 transitions. [2024-11-19 14:47:01,082 INFO L425 stractBuchiCegarLoop]: Abstraction has 1235 states and 1279 transitions. [2024-11-19 14:47:01,082 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-11-19 14:47:01,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1235 states and 1279 transitions. [2024-11-19 14:47:01,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 211 [2024-11-19 14:47:01,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:01,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:01,088 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [40, 40, 40, 40, 10, 10, 9, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:47:01,088 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [37, 37, 37, 37, 5, 5, 5, 1, 1, 1] [2024-11-19 14:47:01,089 INFO L745 eck$LassoCheckResult]: Stem: 68968#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 68953#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 68947#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 68948#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 68952#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 68951#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 68949#L33-1 main_~i~0#1 := 0; 68950#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 68982#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 68975#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 68972#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 68973#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 69324#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69322#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69320#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69318#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69316#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 69314#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 69312#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 69310#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 69308#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 69306#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 69304#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69302#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69300#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69298#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69296#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69294#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69292#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69290#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69288#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 69286#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 69284#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 69282#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69280#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69278#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69276#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69274#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69272#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69270#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69268#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69266#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69264#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69262#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69260#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69258#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 69256#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 69254#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 69252#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 69249#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 69247#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 69245#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69243#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69241#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69239#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69237#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69235#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69233#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69231#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69229#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69227#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69225#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69223#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69220#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 69218#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 69216#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 69214#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69212#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69210#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69208#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69206#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69205#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69203#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69201#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69198#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69196#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69194#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69192#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69190#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69188#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69186#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69184#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69182#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 69180#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 69178#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 69176#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69174#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69172#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69170#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69168#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69166#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69164#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69162#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69160#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69158#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69156#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69154#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69152#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69150#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69148#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69146#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69144#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69143#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69141#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69139#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69136#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 69133#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 69130#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 69131#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 69123#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 69125#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 69117#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69118#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69111#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69112#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69105#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69106#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69100#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69101#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69094#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69095#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69087#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69088#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69081#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69082#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69075#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69076#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69069#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 69070#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 69064#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 69063#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69062#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69061#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69060#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69059#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69058#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69057#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69056#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69055#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69054#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69053#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69052#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69051#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69050#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69049#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69048#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69047#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69046#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69045#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69044#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69043#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 69042#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 69041#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 69040#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69039#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69038#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69037#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69036#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69035#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69034#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69033#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69032#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69031#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69030#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69029#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69028#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69027#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69026#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69025#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69024#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69023#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69022#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69021#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69020#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69017#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69019#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69018#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69016#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 69015#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 69014#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 69012#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69011#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69010#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69009#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69008#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69007#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69006#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69005#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69004#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69003#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69002#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69001#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69000#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68999#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68998#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68997#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68996#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68995#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68994#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68993#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68992#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68991#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68990#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68989#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68988#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68985#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68987#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68986#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68984#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 68983#L35-2 [2024-11-19 14:47:01,089 INFO L747 eck$LassoCheckResult]: Loop: 68983#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 68981#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 68979#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 69327#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 68960#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 68961#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69585#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69584#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69583#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69582#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69581#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69580#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69579#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69578#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69577#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69576#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69575#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69574#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69573#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69572#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69571#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69570#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69569#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69568#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69567#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69566#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69560#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69563#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69561#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69559#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 69558#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 69557#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 69556#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69555#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69554#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69552#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69550#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69548#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69546#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69544#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69542#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69539#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69537#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69535#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69533#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69531#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69529#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69527#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69525#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69523#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69521#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69519#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69517#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69515#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69513#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69511#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69509#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69502#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69506#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69504#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69501#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 69499#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 69497#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 69495#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69493#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69491#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69489#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69487#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69485#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69483#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69481#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69479#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69477#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69476#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69474#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69472#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69469#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69467#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69465#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69463#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69461#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69459#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69457#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69455#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69453#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69451#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69398#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69396#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69394#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69392#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69390#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69387#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 69385#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 69383#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 69381#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69379#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69377#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69375#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69373#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69371#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69369#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69367#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69365#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69362#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69359#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69356#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69353#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69350#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69347#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69345#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69342#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69339#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69336#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69132#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69129#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69126#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69122#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69119#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69116#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69113#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69110#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69107#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69104#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69093#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69099#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69096#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69092#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 69089#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 69086#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 69083#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69080#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69077#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69074#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69071#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69068#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69065#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69013#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69012#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69011#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69010#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69009#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69008#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69007#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69006#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69005#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69004#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 69003#L18 assume !(0 == __VERIFIER_assert_~cond#1); 69002#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 69001#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 69000#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68999#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68998#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68997#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68996#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68995#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68994#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68993#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68992#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68991#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68990#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68989#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68988#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68985#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68987#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 68986#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68984#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 68983#L35-2 [2024-11-19 14:47:01,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:01,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1385180812, now seen corresponding path program 19 times [2024-11-19 14:47:01,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:01,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028551345] [2024-11-19 14:47:01,091 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:47:01,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:01,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:01,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:01,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:01,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2087416555, now seen corresponding path program 15 times [2024-11-19 14:47:01,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:01,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13028628] [2024-11-19 14:47:01,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:47:01,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:01,222 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-11-19 14:47:01,223 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:47:01,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2884 backedges. 1800 proven. 770 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-19 14:47:01,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:47:01,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13028628] [2024-11-19 14:47:01,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13028628] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:47:01,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253205259] [2024-11-19 14:47:01,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:47:01,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:47:01,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:01,574 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:47:01,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2024-11-19 14:47:01,723 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-11-19 14:47:01,723 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:47:01,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 14:47:01,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:01,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2884 backedges. 1192 proven. 1411 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2024-11-19 14:47:01,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:47:02,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2884 backedges. 1192 proven. 1411 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2024-11-19 14:47:02,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253205259] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:47:02,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:47:02,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 22] total 24 [2024-11-19 14:47:02,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437300851] [2024-11-19 14:47:02,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:47:02,222 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:47:02,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:47:02,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 14:47:02,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2024-11-19 14:47:02,223 INFO L87 Difference]: Start difference. First operand 1235 states and 1279 transitions. cyclomatic complexity: 59 Second operand has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:02,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:47:02,807 INFO L93 Difference]: Finished difference Result 2386 states and 2467 transitions. [2024-11-19 14:47:02,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2386 states and 2467 transitions. [2024-11-19 14:47:02,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 290 [2024-11-19 14:47:02,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2386 states to 2386 states and 2467 transitions. [2024-11-19 14:47:02,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2024-11-19 14:47:02,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2024-11-19 14:47:02,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2386 states and 2467 transitions. [2024-11-19 14:47:02,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:47:02,820 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2386 states and 2467 transitions. [2024-11-19 14:47:02,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states and 2467 transitions. [2024-11-19 14:47:02,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 1816. [2024-11-19 14:47:02,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1816 states, 1816 states have (on average 1.0385462555066078) internal successors, (1886), 1815 states have internal predecessors, (1886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:02,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 1886 transitions. [2024-11-19 14:47:02,840 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1816 states and 1886 transitions. [2024-11-19 14:47:02,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-19 14:47:02,840 INFO L425 stractBuchiCegarLoop]: Abstraction has 1816 states and 1886 transitions. [2024-11-19 14:47:02,841 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-11-19 14:47:02,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1816 states and 1886 transitions. [2024-11-19 14:47:02,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 219 [2024-11-19 14:47:02,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:02,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:02,845 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [40, 40, 40, 40, 10, 10, 10, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:47:02,845 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [30, 30, 30, 30, 4, 4, 4, 1, 1, 1] [2024-11-19 14:47:02,846 INFO L745 eck$LassoCheckResult]: Stem: 73681#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 73665#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 73659#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 73660#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 73664#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 73663#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 73661#L33-1 main_~i~0#1 := 0; 73662#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 73684#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 73687#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 73691#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 73694#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 74087#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74086#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74085#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74084#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74083#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 74082#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 74081#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 74080#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 74079#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 74078#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 74077#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74076#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74075#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74074#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74073#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74072#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74071#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74070#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74069#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 74068#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 74067#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 74066#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74065#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74064#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74063#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74062#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74061#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74060#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74059#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74058#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74057#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74056#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74055#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74054#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 74053#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 74052#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 74051#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 74049#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 74048#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 74047#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74046#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74045#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74044#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74043#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74042#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74041#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74040#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74039#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74038#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74037#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74036#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74034#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 74033#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 74032#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 74031#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74030#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74029#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74028#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74027#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74026#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74025#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74024#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74023#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74022#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74021#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74020#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74019#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74018#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74017#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74016#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74015#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 74014#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 74013#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 74012#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74011#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74010#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74009#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74008#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74007#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74006#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74005#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74004#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74003#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74002#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74001#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74000#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 73999#L18 assume !(0 == __VERIFIER_assert_~cond#1); 73998#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 73997#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 73996#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 73995#L18 assume !(0 == __VERIFIER_assert_~cond#1); 73994#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 73993#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 73992#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 73989#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 73990#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 73965#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 73966#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 74273#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 73954#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 73955#L18 assume !(0 == __VERIFIER_assert_~cond#1); 73946#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 73947#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 73938#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 73939#L18 assume !(0 == __VERIFIER_assert_~cond#1); 73930#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 73931#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 73922#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 73923#L18 assume !(0 == __VERIFIER_assert_~cond#1); 73914#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 73915#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 73906#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 73907#L18 assume !(0 == __VERIFIER_assert_~cond#1); 73792#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 73793#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 73786#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 73787#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 73782#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 73781#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 73780#L18 assume !(0 == __VERIFIER_assert_~cond#1); 73779#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 73778#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 73777#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 73776#L18 assume !(0 == __VERIFIER_assert_~cond#1); 73775#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 73774#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 73773#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 73772#L18 assume !(0 == __VERIFIER_assert_~cond#1); 73771#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 73770#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 73769#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 73768#L18 assume !(0 == __VERIFIER_assert_~cond#1); 73767#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 73766#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 73765#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 73764#L18 assume !(0 == __VERIFIER_assert_~cond#1); 73763#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 73762#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 73761#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 73760#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 73759#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 73758#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 73757#L18 assume !(0 == __VERIFIER_assert_~cond#1); 73756#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 73755#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 73754#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 73753#L18 assume !(0 == __VERIFIER_assert_~cond#1); 73752#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 73751#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 73750#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 73749#L18 assume !(0 == __VERIFIER_assert_~cond#1); 73748#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 73747#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 73746#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 73745#L18 assume !(0 == __VERIFIER_assert_~cond#1); 73744#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 73743#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 73742#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 73741#L18 assume !(0 == __VERIFIER_assert_~cond#1); 73740#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 73739#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 73738#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 73737#L18 assume !(0 == __VERIFIER_assert_~cond#1); 73736#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 73735#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 73733#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 73732#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 73731#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 73729#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 73728#L18 assume !(0 == __VERIFIER_assert_~cond#1); 73727#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 73726#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 73725#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 73724#L18 assume !(0 == __VERIFIER_assert_~cond#1); 73723#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 73722#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 73721#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 73720#L18 assume !(0 == __VERIFIER_assert_~cond#1); 73719#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 73718#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 73717#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 73716#L18 assume !(0 == __VERIFIER_assert_~cond#1); 73715#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 73714#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 73713#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 73712#L18 assume !(0 == __VERIFIER_assert_~cond#1); 73711#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 73710#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 73709#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 73708#L18 assume !(0 == __VERIFIER_assert_~cond#1); 73707#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 73706#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 73705#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 73702#L18 assume !(0 == __VERIFIER_assert_~cond#1); 73704#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 73703#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 73701#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 73699#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 73700#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 73689#L34-2 [2024-11-19 14:47:02,846 INFO L747 eck$LassoCheckResult]: Loop: 73689#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 74088#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 73673#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 73674#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74785#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74784#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74783#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74782#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74781#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74780#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74779#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74778#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74777#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74776#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74775#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74774#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74773#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74772#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74771#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74770#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74769#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74768#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74767#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74766#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74765#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74764#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74763#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74761#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 74760#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 74759#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 74758#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74757#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74756#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74755#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74754#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74753#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74752#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74751#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74750#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74749#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74748#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74747#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74746#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74745#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74744#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74743#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74742#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74741#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74740#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74739#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74738#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74737#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74736#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74735#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74734#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 73873#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74733#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74732#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74731#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 74730#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 74729#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 74728#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74727#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74725#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74723#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74721#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74719#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74717#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74715#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74713#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74711#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74709#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74707#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74705#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74703#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74701#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74699#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74697#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74695#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74693#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74691#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74689#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74687#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74685#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74683#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74681#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74679#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74677#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74675#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74673#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74667#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74671#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74669#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74666#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 74663#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 74662#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 74660#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74659#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74658#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74651#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74649#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74647#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74645#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74643#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74641#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74639#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74637#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74635#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74633#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74631#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74629#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74627#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74625#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74623#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74621#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74619#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74617#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74615#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74613#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74611#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74609#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74607#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74605#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74603#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74601#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74599#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74597#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74595#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74212#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 73987#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74207#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 74203#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 73986#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 73988#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 73688#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 73689#L34-2 [2024-11-19 14:47:02,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:02,847 INFO L85 PathProgramCache]: Analyzing trace with hash 281103667, now seen corresponding path program 20 times [2024-11-19 14:47:02,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:02,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951109136] [2024-11-19 14:47:02,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:47:02,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:02,885 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:47:02,886 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:02,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:02,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:02,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:02,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1542323504, now seen corresponding path program 16 times [2024-11-19 14:47:02,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:02,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900134411] [2024-11-19 14:47:02,928 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:47:02,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:02,948 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:47:02,948 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:47:03,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1882 backedges. 45 proven. 1562 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-11-19 14:47:03,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:47:03,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900134411] [2024-11-19 14:47:03,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900134411] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:47:03,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110797229] [2024-11-19 14:47:03,306 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:47:03,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:47:03,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:03,308 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:47:03,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2024-11-19 14:47:03,430 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:47:03,430 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:47:03,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 14:47:03,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:03,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1882 backedges. 45 proven. 1473 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 14:47:03,982 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:47:04,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1882 backedges. 66 proven. 1452 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 14:47:04,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110797229] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:47:04,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:47:04,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 13] total 41 [2024-11-19 14:47:04,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116603973] [2024-11-19 14:47:04,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:47:04,331 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:47:04,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:47:04,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-19 14:47:04,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1434, Unknown=0, NotChecked=0, Total=1722 [2024-11-19 14:47:04,332 INFO L87 Difference]: Start difference. First operand 1816 states and 1886 transitions. cyclomatic complexity: 93 Second operand has 42 states, 41 states have (on average 4.024390243902439) internal successors, (165), 42 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:06,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:47:06,427 INFO L93 Difference]: Finished difference Result 3186 states and 3289 transitions. [2024-11-19 14:47:06,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3186 states and 3289 transitions. [2024-11-19 14:47:06,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 338 [2024-11-19 14:47:06,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3186 states to 3034 states and 3133 transitions. [2024-11-19 14:47:06,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-19 14:47:06,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-19 14:47:06,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3034 states and 3133 transitions. [2024-11-19 14:47:06,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:47:06,441 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3034 states and 3133 transitions. [2024-11-19 14:47:06,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3034 states and 3133 transitions. [2024-11-19 14:47:06,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3034 to 2585. [2024-11-19 14:47:06,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2585 states, 2585 states have (on average 1.0352030947775628) internal successors, (2676), 2584 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:06,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 2676 transitions. [2024-11-19 14:47:06,464 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2585 states and 2676 transitions. [2024-11-19 14:47:06,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2024-11-19 14:47:06,465 INFO L425 stractBuchiCegarLoop]: Abstraction has 2585 states and 2676 transitions. [2024-11-19 14:47:06,465 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2024-11-19 14:47:06,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2585 states and 2676 transitions. [2024-11-19 14:47:06,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 305 [2024-11-19 14:47:06,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:06,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:06,471 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [40, 40, 40, 40, 10, 10, 10, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:47:06,471 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [50, 50, 50, 50, 6, 6, 6, 1, 1, 1] [2024-11-19 14:47:06,471 INFO L745 eck$LassoCheckResult]: Stem: 79730#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 79720#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 79712#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 79713#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 79717#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 79716#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 79714#L33-1 main_~i~0#1 := 0; 79715#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 80486#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 80485#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 80484#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 80483#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 80482#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80481#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80480#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80479#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80478#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 80477#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 80476#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 80475#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 80474#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 80473#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 80472#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80471#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80470#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80469#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80468#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80467#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80466#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80465#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80464#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 80463#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 80462#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 80461#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80460#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80459#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80458#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80457#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80456#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80455#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80454#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80453#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80452#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80451#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80450#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80449#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 80448#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 80447#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 80446#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 80444#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 80443#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 80442#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80441#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80440#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80439#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80438#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80437#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80436#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80435#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80434#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80433#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80432#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80431#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80429#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 80428#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 80427#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 80426#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80425#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80424#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80423#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80422#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80421#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80420#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80419#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80418#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80417#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80416#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80415#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80414#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80413#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80412#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80411#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80410#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 80409#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 80408#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 80407#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80406#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80405#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80404#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80403#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80402#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80401#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80400#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80399#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80398#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80397#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80396#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80395#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80394#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80393#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80392#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80391#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80390#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80389#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80388#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80387#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 80386#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 80385#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 80384#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 80383#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 80382#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 80381#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80380#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80379#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80378#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80377#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80376#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80375#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80374#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80373#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80372#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80371#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80370#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80369#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80368#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80367#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80366#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80365#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 80363#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 80364#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 80845#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80844#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80843#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80842#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80841#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80840#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80839#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80838#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80837#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80836#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80835#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80834#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80833#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80832#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80831#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80830#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80829#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80828#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80827#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80826#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80825#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 80824#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 80823#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 80822#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80821#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80820#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80819#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80818#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80817#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80816#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80815#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80814#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80813#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80812#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80811#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80810#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80809#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80808#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80807#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80806#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80805#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80804#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80803#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80802#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80801#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80800#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 79790#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 79787#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 79785#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 79782#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 79781#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 79776#L18 assume !(0 == __VERIFIER_assert_~cond#1); 79777#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 79772#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 79773#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 79768#L18 assume !(0 == __VERIFIER_assert_~cond#1); 79769#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 79764#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 79765#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 79760#L18 assume !(0 == __VERIFIER_assert_~cond#1); 79761#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80633#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80632#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 79755#L18 assume !(0 == __VERIFIER_assert_~cond#1); 79754#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 79753#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 79751#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 79752#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80626#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80625#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80624#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80623#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80622#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 79743#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 79741#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 79742#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80494#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80493#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80492#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 80491#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 80490#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 80487#L34-2 [2024-11-19 14:47:06,472 INFO L747 eck$LassoCheckResult]: Loop: 80487#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 79735#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 79724#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 79725#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82296#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82295#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 79727#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 79718#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 79719#L18 assume !(0 == __VERIFIER_assert_~cond#1); 79728#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 79729#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82294#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82293#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82292#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82291#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82290#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82289#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82288#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82287#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82286#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82285#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82284#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82218#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82216#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82215#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82214#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82213#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82212#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 79733#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 79734#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 82283#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82282#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82281#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82280#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82279#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82278#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82277#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82276#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82275#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82274#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82273#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82272#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82271#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82270#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82269#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82268#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82267#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82266#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82265#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82264#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82263#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82262#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82261#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82260#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82259#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82070#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82258#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82257#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82256#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 82255#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 82254#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 82253#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82252#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82251#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82250#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82249#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82248#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82247#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82246#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82245#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82244#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82243#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82242#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82241#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82240#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82239#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82238#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82237#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82236#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82235#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82234#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82233#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82232#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82231#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82230#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82229#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82228#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82227#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82226#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82225#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82220#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82224#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82223#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82219#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 82217#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 82128#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 82126#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82125#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82124#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82123#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82122#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82121#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82120#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82119#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82118#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82117#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82116#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82115#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82114#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82113#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82112#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82111#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82110#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82109#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82108#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82107#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82106#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82105#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82104#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82103#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82102#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82101#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82100#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82099#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 82098#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82097#L18 assume !(0 == __VERIFIER_assert_~cond#1); 82096#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 82095#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81971#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81963#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81968#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 81965#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81962#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 81961#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 81959#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 81957#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81954#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81952#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 81950#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81949#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81948#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81947#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 81946#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81945#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81944#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81943#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 81942#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81941#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81940#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81939#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 81938#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81937#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81936#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81935#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 81934#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81933#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81932#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81931#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 81930#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81929#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81928#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81927#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 81926#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81925#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81924#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81923#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 81922#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81921#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81920#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81919#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 81918#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81917#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81557#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81916#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 81558#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81556#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 81554#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 81553#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 80489#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81552#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81551#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 81510#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81509#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81508#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81507#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 81506#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81505#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81504#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81503#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 81502#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81501#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81500#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81499#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 81498#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81497#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81496#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81495#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 81494#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81493#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81438#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81255#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 81252#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81250#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80621#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80619#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80615#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80611#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80607#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80603#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80599#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80507#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80504#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80503#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80502#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80501#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80498#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80500#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 80499#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80497#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 80496#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 80488#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 80487#L34-2 [2024-11-19 14:47:06,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:06,472 INFO L85 PathProgramCache]: Analyzing trace with hash 281103667, now seen corresponding path program 21 times [2024-11-19 14:47:06,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:06,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968883798] [2024-11-19 14:47:06,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:47:06,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:06,512 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2024-11-19 14:47:06,513 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:06,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:06,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:06,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:06,550 INFO L85 PathProgramCache]: Analyzing trace with hash -71055888, now seen corresponding path program 17 times [2024-11-19 14:47:06,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:06,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516016197] [2024-11-19 14:47:06,551 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:47:06,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:06,616 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2024-11-19 14:47:06,617 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:47:07,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 2372 proven. 2349 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-11-19 14:47:07,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:47:07,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516016197] [2024-11-19 14:47:07,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516016197] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:47:07,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036342533] [2024-11-19 14:47:07,223 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:47:07,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:47:07,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:07,225 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:47:07,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2024-11-19 14:47:07,462 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2024-11-19 14:47:07,462 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:47:07,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 14:47:07,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:07,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 2372 proven. 2349 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-11-19 14:47:07,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:47:08,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 2372 proven. 2349 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-11-19 14:47:08,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036342533] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:47:08,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:47:08,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 25 [2024-11-19 14:47:08,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105886682] [2024-11-19 14:47:08,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:47:08,074 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:47:08,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:47:08,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 14:47:08,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2024-11-19 14:47:08,075 INFO L87 Difference]: Start difference. First operand 2585 states and 2676 transitions. cyclomatic complexity: 124 Second operand has 25 states, 25 states have (on average 4.2) internal successors, (105), 25 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:08,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:47:08,937 INFO L93 Difference]: Finished difference Result 3481 states and 3598 transitions. [2024-11-19 14:47:08,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3481 states and 3598 transitions. [2024-11-19 14:47:08,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 394 [2024-11-19 14:47:08,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3481 states to 3481 states and 3598 transitions. [2024-11-19 14:47:08,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-11-19 14:47:08,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-19 14:47:08,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3481 states and 3598 transitions. [2024-11-19 14:47:08,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:47:08,960 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3481 states and 3598 transitions. [2024-11-19 14:47:08,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3481 states and 3598 transitions. [2024-11-19 14:47:08,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3481 to 2929. [2024-11-19 14:47:08,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2929 states, 2929 states have (on average 1.0348241720723796) internal successors, (3031), 2928 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 3031 transitions. [2024-11-19 14:47:08,999 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2929 states and 3031 transitions. [2024-11-19 14:47:08,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-19 14:47:09,000 INFO L425 stractBuchiCegarLoop]: Abstraction has 2929 states and 3031 transitions. [2024-11-19 14:47:09,000 INFO L332 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2024-11-19 14:47:09,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2929 states and 3031 transitions. [2024-11-19 14:47:09,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 352 [2024-11-19 14:47:09,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:09,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:09,006 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [40, 40, 40, 40, 10, 10, 10, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:47:09,007 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [51, 51, 51, 51, 6, 6, 6, 1, 1, 1] [2024-11-19 14:47:09,007 INFO L745 eck$LassoCheckResult]: Stem: 87245#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 87232#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 87226#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 87227#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 87231#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 87230#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 87228#L33-1 main_~i~0#1 := 0; 87229#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 87249#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 87252#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 87253#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 87239#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 87240#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 89022#L18 assume !(0 == __VERIFIER_assert_~cond#1); 89021#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 89020#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 89019#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 89018#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 89017#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 87237#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 87238#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 89016#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 89015#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 89014#L18 assume !(0 == __VERIFIER_assert_~cond#1); 89013#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 89012#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 89011#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 89010#L18 assume !(0 == __VERIFIER_assert_~cond#1); 89009#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 89008#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 89007#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 89006#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 89005#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 89004#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 89003#L18 assume !(0 == __VERIFIER_assert_~cond#1); 89002#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 89001#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 89000#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 88999#L18 assume !(0 == __VERIFIER_assert_~cond#1); 88998#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 88997#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 88996#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 88995#L18 assume !(0 == __VERIFIER_assert_~cond#1); 88994#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 88993#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 88992#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 88991#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 88990#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 88989#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 88987#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 88986#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 88985#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 88984#L18 assume !(0 == __VERIFIER_assert_~cond#1); 88983#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 88982#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 88981#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 88980#L18 assume !(0 == __VERIFIER_assert_~cond#1); 88979#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 88978#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 88977#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 88976#L18 assume !(0 == __VERIFIER_assert_~cond#1); 88975#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 88974#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 88972#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 88971#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 88970#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 88969#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 88968#L18 assume !(0 == __VERIFIER_assert_~cond#1); 88967#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 88966#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 88965#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 88964#L18 assume !(0 == __VERIFIER_assert_~cond#1); 88963#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 88962#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 88961#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 88960#L18 assume !(0 == __VERIFIER_assert_~cond#1); 88959#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 88958#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 88957#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 88956#L18 assume !(0 == __VERIFIER_assert_~cond#1); 88955#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 88954#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 88953#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 88952#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 88951#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 88950#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 88949#L18 assume !(0 == __VERIFIER_assert_~cond#1); 88948#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 88947#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 88946#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 88945#L18 assume !(0 == __VERIFIER_assert_~cond#1); 88944#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 88943#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 88942#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 88941#L18 assume !(0 == __VERIFIER_assert_~cond#1); 88940#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 88939#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 88938#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 88937#L18 assume !(0 == __VERIFIER_assert_~cond#1); 88936#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 88935#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 88934#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 88933#L18 assume !(0 == __VERIFIER_assert_~cond#1); 88932#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 88931#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 88918#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 88919#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 89352#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 88109#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 88110#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 89351#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 89350#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 89349#L18 assume !(0 == __VERIFIER_assert_~cond#1); 89348#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 89347#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 89346#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 89345#L18 assume !(0 == __VERIFIER_assert_~cond#1); 89344#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 89343#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 89342#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 89341#L18 assume !(0 == __VERIFIER_assert_~cond#1); 89340#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 89339#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 89338#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 89337#L18 assume !(0 == __VERIFIER_assert_~cond#1); 89336#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 89335#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 89334#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 89332#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 89333#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 89700#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 89699#L18 assume !(0 == __VERIFIER_assert_~cond#1); 89698#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 89697#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 89696#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 89695#L18 assume !(0 == __VERIFIER_assert_~cond#1); 89694#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 89693#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 89692#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 89691#L18 assume !(0 == __VERIFIER_assert_~cond#1); 89690#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 89689#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 89688#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 89687#L18 assume !(0 == __VERIFIER_assert_~cond#1); 89686#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 89685#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 89684#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 89683#L18 assume !(0 == __VERIFIER_assert_~cond#1); 89682#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 89681#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 89680#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 89679#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 89678#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 89677#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 89676#L18 assume !(0 == __VERIFIER_assert_~cond#1); 89675#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 89674#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 89673#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 89672#L18 assume !(0 == __VERIFIER_assert_~cond#1); 89671#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 89670#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 89669#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 89668#L18 assume !(0 == __VERIFIER_assert_~cond#1); 89667#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 89666#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 89665#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 89664#L18 assume !(0 == __VERIFIER_assert_~cond#1); 89663#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 89662#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 89661#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 89660#L18 assume !(0 == __VERIFIER_assert_~cond#1); 89659#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 89658#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 89657#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 89656#L18 assume !(0 == __VERIFIER_assert_~cond#1); 89655#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 89654#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 89652#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 89651#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 89650#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 89648#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 89647#L18 assume !(0 == __VERIFIER_assert_~cond#1); 89646#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 89645#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 89644#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 89643#L18 assume !(0 == __VERIFIER_assert_~cond#1); 89642#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 89641#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 89640#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 89639#L18 assume !(0 == __VERIFIER_assert_~cond#1); 89638#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 89637#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 89636#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 89635#L18 assume !(0 == __VERIFIER_assert_~cond#1); 89634#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 89633#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 89632#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 89631#L18 assume !(0 == __VERIFIER_assert_~cond#1); 89630#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 89629#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 89628#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 89627#L18 assume !(0 == __VERIFIER_assert_~cond#1); 89626#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 89462#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 88928#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 88916#L18 assume !(0 == __VERIFIER_assert_~cond#1); 88923#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 88920#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 88915#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 88912#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 88046#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 87258#L34-2 [2024-11-19 14:47:09,007 INFO L747 eck$LassoCheckResult]: Loop: 87258#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 88045#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 88044#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 88042#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 88041#L18 assume !(0 == __VERIFIER_assert_~cond#1); 88037#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 88036#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 88035#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 88034#L18 assume !(0 == __VERIFIER_assert_~cond#1); 88032#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 88030#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 88028#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 88026#L18 assume !(0 == __VERIFIER_assert_~cond#1); 88024#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 88022#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 88020#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 88018#L18 assume !(0 == __VERIFIER_assert_~cond#1); 88016#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 88014#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 88012#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 88010#L18 assume !(0 == __VERIFIER_assert_~cond#1); 88008#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 88006#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 88004#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 88002#L18 assume !(0 == __VERIFIER_assert_~cond#1); 88000#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87998#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87995#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 87993#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 87991#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 87989#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87987#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87985#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87983#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87981#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87979#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87977#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87975#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87973#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87971#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87969#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87967#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87965#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87964#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87962#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87960#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87957#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87955#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87953#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87951#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87949#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87947#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87945#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87943#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87941#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87625#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87938#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87936#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87934#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 87932#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 87930#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 87928#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87926#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87924#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87922#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87920#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87918#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87916#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87914#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87912#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87910#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87908#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87906#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87904#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87902#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87900#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87898#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87896#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87894#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87892#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87890#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87888#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87887#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87885#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87883#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87880#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87878#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87876#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87874#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87872#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87864#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87869#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87868#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87863#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 87861#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 87859#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 87857#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87855#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87853#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87851#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87849#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87847#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87845#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87843#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87841#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87839#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87837#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87835#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87833#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87831#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87829#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87827#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87825#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87823#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87821#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87819#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87817#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87815#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87813#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87811#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87809#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87807#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87805#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87803#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87801#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87799#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87798#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87796#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87794#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87786#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87790#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87788#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87785#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 87783#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 87781#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 87777#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87774#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87771#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87768#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87765#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87762#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87759#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87756#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87753#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87750#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87747#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87744#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87741#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87740#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87737#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87734#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87729#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87576#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87573#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87570#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87567#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87564#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87561#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87558#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87555#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87552#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87549#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87546#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87543#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87540#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87537#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87534#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87531#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87528#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87525#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87522#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87519#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87511#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87515#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87513#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87510#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 87425#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 87423#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 87259#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87419#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87417#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87415#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87412#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87409#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87406#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87302#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87301#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87300#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87299#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87298#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87297#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87296#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87295#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87294#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87293#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87292#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87291#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87290#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87289#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87288#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87287#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87286#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87285#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87284#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87283#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87282#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87281#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87280#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87279#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87278#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87277#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87276#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87275#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87274#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87273#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87272#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87271#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87270#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87269#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 87263#L18 assume !(0 == __VERIFIER_assert_~cond#1); 87268#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 87267#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 87262#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 87264#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 87257#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 87258#L34-2 [2024-11-19 14:47:09,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:09,008 INFO L85 PathProgramCache]: Analyzing trace with hash 281103667, now seen corresponding path program 22 times [2024-11-19 14:47:09,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:09,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740032304] [2024-11-19 14:47:09,009 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:47:09,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:09,044 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:47:09,045 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:09,045 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:09,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:09,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:09,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1550070848, now seen corresponding path program 18 times [2024-11-19 14:47:09,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:09,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421927320] [2024-11-19 14:47:09,087 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:47:09,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:09,152 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 44 check-sat command(s) [2024-11-19 14:47:09,152 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:09,152 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:09,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:09,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:09,196 INFO L85 PathProgramCache]: Analyzing trace with hash 142482638, now seen corresponding path program 23 times [2024-11-19 14:47:09,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:09,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534296205] [2024-11-19 14:47:09,197 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:47:09,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:09,383 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2024-11-19 14:47:09,383 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:47:10,275 INFO L134 CoverageAnalysis]: Checked inductivity of 18332 backedges. 7242 proven. 8494 refuted. 0 times theorem prover too weak. 2596 trivial. 0 not checked. [2024-11-19 14:47:10,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:47:10,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534296205] [2024-11-19 14:47:10,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534296205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:47:10,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430334835] [2024-11-19 14:47:10,276 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:47:10,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:47:10,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:10,278 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:47:10,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2024-11-19 14:47:10,679 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2024-11-19 14:47:10,679 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:47:10,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 14:47:10,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:11,435 INFO L134 CoverageAnalysis]: Checked inductivity of 18332 backedges. 11149 proven. 4930 refuted. 0 times theorem prover too weak. 2253 trivial. 0 not checked. [2024-11-19 14:47:11,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:47:11,982 INFO L134 CoverageAnalysis]: Checked inductivity of 18332 backedges. 10584 proven. 5495 refuted. 0 times theorem prover too weak. 2253 trivial. 0 not checked. [2024-11-19 14:47:11,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430334835] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:47:11,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:47:11,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 49 [2024-11-19 14:47:11,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77349722] [2024-11-19 14:47:11,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:47:17,033 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:47:17,033 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:47:17,033 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:47:17,033 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:47:17,033 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:47:17,033 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,033 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:47:17,033 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:47:17,034 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration23_Loop [2024-11-19 14:47:17,034 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:47:17,034 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:47:17,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,085 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:47:17,085 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:47:17,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,088 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:47:17,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2024-11-19 14:47:17,090 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:47:17,090 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:17,106 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:47:17,107 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:47:17,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2024-11-19 14:47:17,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,123 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:47:17,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2024-11-19 14:47:17,125 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:47:17,125 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:17,141 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:47:17,142 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0#1=0} Honda state: {ULTIMATE.start_main_~k~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:47:17,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2024-11-19 14:47:17,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,158 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:47:17,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2024-11-19 14:47:17,160 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:47:17,160 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:17,182 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:47:17,183 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0#1=7} Honda state: {ULTIMATE.start_main_~n~0#1=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:47:17,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2024-11-19 14:47:17,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,199 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:47:17,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2024-11-19 14:47:17,201 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:47:17,201 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:17,216 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:47:17,216 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0#1=0} Honda state: {ULTIMATE.start_main_~j~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:47:17,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2024-11-19 14:47:17,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,232 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:47:17,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2024-11-19 14:47:17,234 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:47:17,235 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:17,248 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:47:17,248 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6#1=0} Honda state: {ULTIMATE.start_main_#t~post6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:47:17,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2024-11-19 14:47:17,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,267 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:47:17,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2024-11-19 14:47:17,269 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:47:17,269 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:17,283 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:47:17,284 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5#1=0} Honda state: {ULTIMATE.start_main_#t~post5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:47:17,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2024-11-19 14:47:17,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,299 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:47:17,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2024-11-19 14:47:17,301 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:47:17,301 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:17,316 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:47:17,316 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4#1=0} Honda state: {ULTIMATE.start_main_#t~post4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:47:17,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2024-11-19 14:47:17,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,333 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:47:17,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2024-11-19 14:47:17,334 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:47:17,335 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:17,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2024-11-19 14:47:17,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,360 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:47:17,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2024-11-19 14:47:17,362 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:47:17,362 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:17,373 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:47:17,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2024-11-19 14:47:17,384 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:47:17,384 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:47:17,384 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:47:17,384 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:47:17,384 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:47:17,384 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,384 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:47:17,384 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:47:17,384 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration23_Loop [2024-11-19 14:47:17,385 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:47:17,385 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:47:17,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,431 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:47:17,431 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:47:17,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,433 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:47:17,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2024-11-19 14:47:17,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:47:17,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:47:17,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:47:17,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:47:17,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:47:17,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:47:17,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:47:17,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:47:17,446 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:47:17,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2024-11-19 14:47:17,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,458 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:47:17,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2024-11-19 14:47:17,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:47:17,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:47:17,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:47:17,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:47:17,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:47:17,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:47:17,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:47:17,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:47:17,473 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:47:17,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2024-11-19 14:47:17,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,485 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:47:17,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2024-11-19 14:47:17,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:47:17,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:47:17,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:47:17,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:47:17,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:47:17,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:47:17,496 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:47:17,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:47:17,498 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:47:17,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2024-11-19 14:47:17,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,509 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:47:17,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2024-11-19 14:47:17,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:47:17,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:47:17,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:47:17,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:47:17,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:47:17,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:47:17,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:47:17,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:47:17,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:47:17,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2024-11-19 14:47:17,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,533 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:47:17,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2024-11-19 14:47:17,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:47:17,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:47:17,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:47:17,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:47:17,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:47:17,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:47:17,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:47:17,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:47:17,546 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:47:17,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2024-11-19 14:47:17,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,557 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:47:17,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2024-11-19 14:47:17,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:47:17,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:47:17,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:47:17,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:47:17,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:47:17,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:47:17,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:47:17,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:47:17,570 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:47:17,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2024-11-19 14:47:17,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,582 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:47:17,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2024-11-19 14:47:17,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:47:17,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:47:17,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:47:17,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:47:17,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:47:17,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:47:17,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:47:17,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:47:17,596 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:47:17,597 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:47:17,597 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:47:17,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,599 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:47:17,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2024-11-19 14:47:17,600 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:47:17,600 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:47:17,600 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:47:17,600 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 11 Supporting invariants [] [2024-11-19 14:47:17,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2024-11-19 14:47:17,611 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:47:17,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:17,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:47:17,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:17,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 14:47:17,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:18,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2024-11-19 14:47:18,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5457 backedges. 0 proven. 1232 refuted. 0 times theorem prover too weak. 4225 trivial. 0 not checked. [2024-11-19 14:47:18,773 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2024-11-19 14:47:18,773 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2929 states and 3031 transitions. cyclomatic complexity: 139 Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:18,933 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2929 states and 3031 transitions. cyclomatic complexity: 139. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 6398 states and 6621 transitions. Complement of second has 22 states. [2024-11-19 14:47:18,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2024-11-19 14:47:18,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:18,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 64 transitions. [2024-11-19 14:47:18,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 64 transitions. Stem has 211 letters. Loop has 225 letters. [2024-11-19 14:47:18,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:18,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 64 transitions. Stem has 436 letters. Loop has 225 letters. [2024-11-19 14:47:18,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:18,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 64 transitions. Stem has 211 letters. Loop has 450 letters. [2024-11-19 14:47:18,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:18,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6398 states and 6621 transitions. [2024-11-19 14:47:18,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 248 [2024-11-19 14:47:18,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6398 states to 4148 states and 4295 transitions. [2024-11-19 14:47:18,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-19 14:47:18,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-19 14:47:18,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4148 states and 4295 transitions. [2024-11-19 14:47:18,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:47:18,970 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4148 states and 4295 transitions. [2024-11-19 14:47:18,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4148 states and 4295 transitions. [2024-11-19 14:47:18,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4148 to 2995. [2024-11-19 14:47:18,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2995 states, 2995 states have (on average 1.0347245409015025) internal successors, (3099), 2994 states have internal predecessors, (3099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:18,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2995 states to 2995 states and 3099 transitions. [2024-11-19 14:47:18,997 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2995 states and 3099 transitions. [2024-11-19 14:47:18,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:47:18,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-19 14:47:18,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=2005, Unknown=0, NotChecked=0, Total=2352 [2024-11-19 14:47:18,999 INFO L87 Difference]: Start difference. First operand 2995 states and 3099 transitions. Second operand has 49 states, 49 states have (on average 4.6938775510204085) internal successors, (230), 49 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:21,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:47:21,358 INFO L93 Difference]: Finished difference Result 5030 states and 5180 transitions. [2024-11-19 14:47:21,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5030 states and 5180 transitions. [2024-11-19 14:47:21,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 245 [2024-11-19 14:47:21,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5030 states to 3358 states and 3464 transitions. [2024-11-19 14:47:21,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-19 14:47:21,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-19 14:47:21,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3358 states and 3464 transitions. [2024-11-19 14:47:21,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:47:21,371 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3358 states and 3464 transitions. [2024-11-19 14:47:21,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3358 states and 3464 transitions. [2024-11-19 14:47:21,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3358 to 2747. [2024-11-19 14:47:21,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2747 states, 2747 states have (on average 1.0331270476883874) internal successors, (2838), 2746 states have internal predecessors, (2838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:21,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2747 states to 2747 states and 2838 transitions. [2024-11-19 14:47:21,443 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2747 states and 2838 transitions. [2024-11-19 14:47:21,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2024-11-19 14:47:21,444 INFO L425 stractBuchiCegarLoop]: Abstraction has 2747 states and 2838 transitions. [2024-11-19 14:47:21,444 INFO L332 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2024-11-19 14:47:21,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2747 states and 2838 transitions. [2024-11-19 14:47:21,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 245 [2024-11-19 14:47:21,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:21,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:21,450 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [75, 75, 75, 75, 15, 15, 15, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:47:21,450 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [56, 56, 56, 56, 6, 6, 6, 1, 1, 1] [2024-11-19 14:47:21,450 INFO L745 eck$LassoCheckResult]: Stem: 108853#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 108842#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 108834#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 108835#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 108839#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 108838#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 108836#L33-1 main_~i~0#1 := 0; 108837#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 108860#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 108843#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 108844#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 110411#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 110409#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110407#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110405#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110403#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110401#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 110399#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 110397#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 108845#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 108846#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 108858#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 110430#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110429#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110428#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110427#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110426#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110425#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110424#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110423#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110422#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 110421#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 110420#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 110419#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110418#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110417#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110416#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110415#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110414#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110413#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110412#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110410#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110408#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110406#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110404#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110402#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 110400#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 110398#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 110396#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 110395#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 110394#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 110393#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110392#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110391#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110390#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110389#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110388#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110387#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110386#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110385#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110384#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110383#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110382#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110381#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 110380#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 110379#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 110378#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110377#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110376#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110375#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110374#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110373#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110372#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110371#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110370#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110369#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110368#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110367#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110366#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110365#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110364#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110363#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110362#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 110361#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 110360#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 110359#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110358#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110357#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110356#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110355#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110354#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110353#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110352#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110351#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110350#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110349#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110348#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110347#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110346#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110345#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110344#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110343#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110342#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110341#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110340#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110339#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 110338#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 110337#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 110336#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 110335#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 110334#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 110333#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110332#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110331#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110330#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110329#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110328#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110327#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110326#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110325#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110324#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110323#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110322#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110321#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110320#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110319#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110318#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110317#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 110316#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 110315#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 110314#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110313#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110312#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110311#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110310#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110309#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110308#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110307#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110306#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110305#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110304#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110303#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110302#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110301#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110300#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110299#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110298#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110297#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110296#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110295#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110294#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 110293#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 110292#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 110291#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110290#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110289#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110288#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110287#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110286#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110285#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110284#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110283#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110282#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110281#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110280#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110279#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110278#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110277#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110276#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110275#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110274#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110273#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110272#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110271#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110270#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110269#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110268#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110267#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 110266#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 110265#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 110264#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110263#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110262#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110261#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110260#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110259#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110258#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110257#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110256#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110255#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110254#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110253#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110252#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110251#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110250#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110249#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110248#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110247#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110246#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110245#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110244#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110243#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110242#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110241#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110240#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110237#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110239#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110238#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110236#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 110235#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 110234#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 110233#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 110232#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 110231#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 110230#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110229#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110228#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110227#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110226#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110225#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110224#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110223#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110222#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110221#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110220#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110219#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110218#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110217#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110216#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110215#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110214#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110213#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110212#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110211#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110210#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 110207#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 110206#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 110205#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110204#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110203#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110202#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110201#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110200#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110199#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110198#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110197#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110196#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110195#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110194#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110193#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110192#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110191#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110190#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110189#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110188#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110187#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110186#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110185#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110184#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110183#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110182#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110181#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 110180#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 110179#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 110178#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110177#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110176#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110175#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110174#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110173#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110172#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110171#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110170#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110169#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110168#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110167#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110166#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110165#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110164#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110163#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110162#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110161#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110160#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110159#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110158#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110157#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110156#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110155#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110154#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110151#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110153#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110152#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110150#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 108980#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 110149#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 110148#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110147#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110146#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110145#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110144#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110143#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110142#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110141#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110140#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110139#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110138#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110137#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110136#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110135#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110134#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110133#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110132#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110131#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110130#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110129#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110128#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110127#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110126#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110125#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110124#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110123#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110122#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110121#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110120#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110117#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110119#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110118#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110116#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 110115#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 110114#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 110113#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110112#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110111#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110110#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110109#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110108#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110107#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110106#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110105#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110104#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110103#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110102#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110101#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110100#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110099#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110098#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110097#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110096#L18 assume !(0 == __VERIFIER_assert_~cond#1); 110095#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 110094#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 110093#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110092#L18 assume !(0 == __VERIFIER_assert_~cond#1); 108935#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 108933#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 108931#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 108929#L18 assume !(0 == __VERIFIER_assert_~cond#1); 108927#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 108925#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 108923#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 108921#L18 assume !(0 == __VERIFIER_assert_~cond#1); 108919#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 108917#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 108915#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 108908#L18 assume !(0 == __VERIFIER_assert_~cond#1); 108912#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 108910#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 108907#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 108854#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 108855#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 108859#L34-2 [2024-11-19 14:47:21,451 INFO L747 eck$LassoCheckResult]: Loop: 108859#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 108857#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 108847#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 108848#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109603#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109600#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109597#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109594#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109591#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109588#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109585#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109582#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109579#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109576#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109573#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109570#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109567#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109564#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109561#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109558#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109554#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109548#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109545#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109542#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109539#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109536#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109533#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109530#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109519#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109525#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109522#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109518#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 109515#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 109512#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 109509#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109506#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109503#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109500#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109497#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109494#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109491#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109488#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109485#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109482#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109479#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109476#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109473#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109471#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109469#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109467#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109465#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109463#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109461#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109459#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109457#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109455#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109453#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109451#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109449#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109447#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109445#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109443#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109441#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109434#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109438#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109436#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109433#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 109431#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 109429#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 109427#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109425#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109423#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109421#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109419#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109417#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109415#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109413#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109411#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109409#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109408#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109406#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109404#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109401#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109399#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109397#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109395#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109393#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109391#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109389#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109387#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109385#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109383#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109381#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109379#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109377#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109376#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109374#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109372#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109369#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109367#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109365#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109362#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109351#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109357#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109354#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109350#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 109347#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 109344#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 109341#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109338#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109314#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109313#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109309#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109306#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109304#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109302#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109300#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109298#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109296#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109294#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109292#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109290#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109288#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109286#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109284#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109282#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109280#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109278#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109276#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109274#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109272#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109270#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109268#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109266#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109264#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109262#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109260#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109258#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109256#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109254#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109252#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109250#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109248#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109246#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109244#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109237#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109241#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109239#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109236#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 109235#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 109233#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 109231#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109228#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109226#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109224#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109221#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109218#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109215#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109212#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109209#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109206#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109203#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109200#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109197#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109194#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109191#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109188#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109185#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109182#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109179#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109176#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109173#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109170#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109167#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109123#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109121#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109119#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109117#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109115#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109113#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109111#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109109#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109107#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109105#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109103#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109101#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109099#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109097#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109095#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109093#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109091#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109089#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109082#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109086#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109084#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109081#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 109080#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 109078#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 108862#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109074#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109072#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109070#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109069#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109068#L18 assume !(0 == __VERIFIER_assert_~cond#1); 109066#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 108936#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 108934#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 108932#L18 assume !(0 == __VERIFIER_assert_~cond#1); 108930#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 108928#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 108926#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 108924#L18 assume !(0 == __VERIFIER_assert_~cond#1); 108922#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 108920#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 108918#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 108916#L18 assume !(0 == __VERIFIER_assert_~cond#1); 108914#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 108913#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 108911#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 108909#L18 assume !(0 == __VERIFIER_assert_~cond#1); 108906#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 108904#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 108905#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 108900#L18 assume !(0 == __VERIFIER_assert_~cond#1); 108901#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 108896#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 108897#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 108892#L18 assume !(0 == __VERIFIER_assert_~cond#1); 108893#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 108888#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 108889#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 108884#L18 assume !(0 == __VERIFIER_assert_~cond#1); 108885#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 108880#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 108881#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 108876#L18 assume !(0 == __VERIFIER_assert_~cond#1); 108877#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 108872#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 108873#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 108869#L18 assume !(0 == __VERIFIER_assert_~cond#1); 108870#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 109128#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 109126#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 109125#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 108861#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 108859#L34-2 [2024-11-19 14:47:21,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:21,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1621320925, now seen corresponding path program 24 times [2024-11-19 14:47:21,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:21,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995224303] [2024-11-19 14:47:21,452 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:47:21,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:21,542 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2024-11-19 14:47:21,543 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:21,543 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:21,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:21,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:21,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1443884944, now seen corresponding path program 19 times [2024-11-19 14:47:21,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:21,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001113437] [2024-11-19 14:47:21,617 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:47:21,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:22,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6547 backedges. 2969 proven. 2912 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2024-11-19 14:47:22,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:47:22,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001113437] [2024-11-19 14:47:22,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001113437] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:47:22,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408502869] [2024-11-19 14:47:22,276 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:47:22,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:47:22,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:22,278 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:47:22,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2024-11-19 14:47:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:22,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 14:47:22,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:22,747 INFO L134 CoverageAnalysis]: Checked inductivity of 6547 backedges. 2534 proven. 3319 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2024-11-19 14:47:22,747 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:47:23,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6547 backedges. 2534 proven. 3319 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2024-11-19 14:47:23,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408502869] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:47:23,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:47:23,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 28 [2024-11-19 14:47:23,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923964356] [2024-11-19 14:47:23,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:47:23,250 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:47:23,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:47:23,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 14:47:23,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2024-11-19 14:47:23,251 INFO L87 Difference]: Start difference. First operand 2747 states and 2838 transitions. cyclomatic complexity: 120 Second operand has 28 states, 28 states have (on average 4.321428571428571) internal successors, (121), 28 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:24,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:47:24,398 INFO L93 Difference]: Finished difference Result 4873 states and 5017 transitions. [2024-11-19 14:47:24,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4873 states and 5017 transitions. [2024-11-19 14:47:24,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 434 [2024-11-19 14:47:24,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4873 states to 4873 states and 5017 transitions. [2024-11-19 14:47:24,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-19 14:47:24,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-19 14:47:24,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4873 states and 5017 transitions. [2024-11-19 14:47:24,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:47:24,417 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4873 states and 5017 transitions. [2024-11-19 14:47:24,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states and 5017 transitions. [2024-11-19 14:47:24,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 3178. [2024-11-19 14:47:24,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3178 states, 3178 states have (on average 1.0317809943360605) internal successors, (3279), 3177 states have internal predecessors, (3279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:24,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 3279 transitions. [2024-11-19 14:47:24,451 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3178 states and 3279 transitions. [2024-11-19 14:47:24,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-11-19 14:47:24,452 INFO L425 stractBuchiCegarLoop]: Abstraction has 3178 states and 3279 transitions. [2024-11-19 14:47:24,452 INFO L332 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2024-11-19 14:47:24,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3178 states and 3279 transitions. [2024-11-19 14:47:24,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 388 [2024-11-19 14:47:24,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:24,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:24,458 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [75, 75, 75, 75, 15, 15, 15, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:47:24,459 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [57, 57, 57, 57, 6, 6, 6, 1, 1, 1] [2024-11-19 14:47:24,459 INFO L745 eck$LassoCheckResult]: Stem: 118095#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 118083#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 118075#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 118076#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 118080#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 118079#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 118077#L33-1 main_~i~0#1 := 0; 118078#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 118100#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 118084#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 118085#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 118601#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 118600#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118599#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118598#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118597#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118596#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 118595#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 118594#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 118593#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 118592#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 118591#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 118590#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118589#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118588#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118587#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118586#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118585#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118584#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118583#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118582#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 118581#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 118580#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 118579#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118578#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118577#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118576#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118575#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118574#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118573#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118572#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118571#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118570#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118569#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118568#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118567#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 118566#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 118565#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 118564#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 118563#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 118562#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 118561#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118560#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118559#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118558#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118557#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118556#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118555#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118554#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118553#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118552#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118551#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118550#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118549#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 118548#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 118547#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 118546#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118545#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118544#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118543#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118542#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118541#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118540#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118539#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118538#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118537#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118536#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118535#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118534#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118533#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118532#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118531#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118530#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 118529#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 118528#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 118527#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118526#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118525#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118524#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118523#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118522#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118521#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118520#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118519#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118518#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118517#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118516#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118515#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118514#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118513#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118512#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118511#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118510#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118509#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118508#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118507#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 118506#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 118505#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 118504#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 118503#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 118502#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 118501#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118500#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118499#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118498#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118497#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118496#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118495#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118494#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118493#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118492#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118491#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118490#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118489#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118488#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118487#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118486#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118485#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 118484#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 118483#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 118482#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118481#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118480#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118479#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118478#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118477#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118476#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118475#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118474#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118473#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118472#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118471#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118470#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118469#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118468#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118467#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118466#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118465#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118464#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118463#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118462#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 118461#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 118460#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 118459#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118458#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118457#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118456#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118455#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118454#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118453#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118452#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118451#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118450#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118449#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118448#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118447#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118446#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118445#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118444#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118443#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118442#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118441#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118440#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118439#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118438#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118437#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118436#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118435#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 118434#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 118433#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 118432#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118431#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118430#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118429#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118428#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118427#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118426#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118425#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118424#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118423#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118422#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118421#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118420#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118419#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118418#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118417#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118416#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118415#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118414#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118413#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118412#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118411#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118410#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118409#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118408#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118405#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118407#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118406#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118404#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 118403#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 118402#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 118400#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 118398#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 118396#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 118394#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118392#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118390#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118388#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118386#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118384#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118382#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118380#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118378#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118376#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118374#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118372#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118370#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118368#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118366#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118364#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118362#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118360#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118358#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118356#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118354#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 118349#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 118345#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 118343#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118341#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118339#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118337#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118335#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118333#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118331#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118329#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118327#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118325#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118323#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118321#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118319#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118317#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118315#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118313#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118311#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118309#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118307#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118305#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118303#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118301#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118299#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118297#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118295#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 118292#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 118290#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 118288#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118286#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118284#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118282#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118280#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118278#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118276#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118274#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118272#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118270#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118268#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118266#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118264#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118262#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118260#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118258#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118256#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118254#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118252#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118250#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118248#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118246#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118244#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118242#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118240#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118238#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118236#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118234#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118232#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 118217#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 118215#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 118213#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118211#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118209#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118207#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118205#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118203#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118201#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118199#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118197#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118195#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118193#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118191#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118189#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118187#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118185#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118183#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118181#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118179#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118177#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118175#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118173#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118171#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118169#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118167#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118165#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118163#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118162#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118160#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118158#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118150#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118154#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118152#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118149#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 118147#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 118145#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 118143#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118142#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118141#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118140#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118139#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118138#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118137#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118136#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118135#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118134#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118133#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118132#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118131#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118130#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118129#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118128#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118127#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118126#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118125#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118124#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118123#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118122#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118121#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118120#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118119#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118118#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118117#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118116#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118115#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118114#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118113#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118112#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118111#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118107#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118110#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118109#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118106#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 118096#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 118097#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 118104#L34-2 [2024-11-19 14:47:24,460 INFO L747 eck$LassoCheckResult]: Loop: 118104#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 118108#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 118088#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 118089#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119246#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119245#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119244#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119243#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119242#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119241#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119240#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119239#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119238#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119237#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119236#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119235#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119234#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119233#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119232#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119231#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119230#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119229#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119228#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119227#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119226#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119225#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119224#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119223#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119222#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119221#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119220#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119218#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 119219#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 119362#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 119361#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119360#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119359#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119358#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119357#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119356#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119355#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119354#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119353#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119352#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119351#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119350#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119349#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119348#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119347#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119346#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119345#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119344#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119343#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119342#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119341#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119340#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119339#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119338#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119337#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119336#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119335#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119334#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119333#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118923#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119332#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119331#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119330#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 119329#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 119328#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 119327#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119326#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119325#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119324#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119323#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119322#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119321#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119320#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119319#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119318#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119317#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119316#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119315#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119314#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119313#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119312#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119311#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119310#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119309#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119308#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119307#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119306#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119305#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119304#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119303#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119302#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119301#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119300#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119299#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119298#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119297#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119296#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119295#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119292#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119294#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119293#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119291#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 119290#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 119289#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 119288#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119287#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119286#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119285#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119284#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119283#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119282#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119281#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119280#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119279#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119278#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119277#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119276#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119275#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119274#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119273#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119272#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119271#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119270#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119269#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119268#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119267#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119266#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119265#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119264#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119263#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119262#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119261#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119260#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119259#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119258#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119257#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119256#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119255#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119254#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119253#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119252#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119249#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119251#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119250#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119248#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 119247#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 119079#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 119076#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119074#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119072#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119070#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119068#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119066#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119064#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119062#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119060#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119058#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119056#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119054#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119052#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119050#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119048#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 119046#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 119044#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 119042#L18 assume !(0 == __VERIFIER_assert_~cond#1); 119040#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118890#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118889#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118887#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118885#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118883#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118881#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118879#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118877#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118875#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118873#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118871#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118869#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118867#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118865#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118863#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118861#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118859#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118857#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118855#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118853#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118851#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118747#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118742#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118745#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118743#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118741#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 118740#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 118739#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 118105#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118738#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118736#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118734#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118733#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118732#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118731#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118650#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118649#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118648#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118647#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118646#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118645#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118644#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118643#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118642#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118641#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118640#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118639#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118638#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118637#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118636#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118635#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118634#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118633#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118632#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118631#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118630#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118629#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118628#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118627#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118626#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118625#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118624#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118623#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118622#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118621#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118620#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118619#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118618#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118617#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118616#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118615#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118614#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118612#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118611#L18 assume !(0 == __VERIFIER_assert_~cond#1); 118610#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 118608#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 118609#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 118737#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 118103#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 118104#L34-2 [2024-11-19 14:47:24,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:24,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1621320925, now seen corresponding path program 25 times [2024-11-19 14:47:24,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:24,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031787913] [2024-11-19 14:47:24,461 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:47:24,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:24,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:24,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:24,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:24,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1973343808, now seen corresponding path program 20 times [2024-11-19 14:47:24,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:24,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945013016] [2024-11-19 14:47:24,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:47:24,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:24,637 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:47:24,638 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:47:25,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6777 backedges. 66 proven. 4824 refuted. 0 times theorem prover too weak. 1887 trivial. 0 not checked. [2024-11-19 14:47:25,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:47:25,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945013016] [2024-11-19 14:47:25,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945013016] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:47:25,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633983035] [2024-11-19 14:47:25,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:47:25,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:47:25,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:25,264 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:47:25,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2024-11-19 14:47:25,486 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:47:25,486 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:47:25,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 14:47:25,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:26,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6777 backedges. 66 proven. 5741 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2024-11-19 14:47:26,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:47:26,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6777 backedges. 91 proven. 5716 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2024-11-19 14:47:26,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633983035] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:47:26,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:47:26,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 16, 16] total 51 [2024-11-19 14:47:26,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954967994] [2024-11-19 14:47:26,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:47:26,862 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:47:26,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:47:26,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-19 14:47:26,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=2257, Unknown=0, NotChecked=0, Total=2652 [2024-11-19 14:47:26,864 INFO L87 Difference]: Start difference. First operand 3178 states and 3279 transitions. cyclomatic complexity: 125 Second operand has 52 states, 51 states have (on average 4.235294117647059) internal successors, (216), 52 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:31,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:47:31,262 INFO L93 Difference]: Finished difference Result 5860 states and 6036 transitions. [2024-11-19 14:47:31,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5860 states and 6036 transitions. [2024-11-19 14:47:31,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 536 [2024-11-19 14:47:31,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5860 states to 5860 states and 6036 transitions. [2024-11-19 14:47:31,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-19 14:47:31,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-19 14:47:31,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5860 states and 6036 transitions. [2024-11-19 14:47:31,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:47:31,278 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5860 states and 6036 transitions. [2024-11-19 14:47:31,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5860 states and 6036 transitions. [2024-11-19 14:47:31,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5860 to 4018. [2024-11-19 14:47:31,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4018 states, 4018 states have (on average 1.0326032852165257) internal successors, (4149), 4017 states have internal predecessors, (4149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:31,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4018 states to 4018 states and 4149 transitions. [2024-11-19 14:47:31,314 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4018 states and 4149 transitions. [2024-11-19 14:47:31,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2024-11-19 14:47:31,315 INFO L425 stractBuchiCegarLoop]: Abstraction has 4018 states and 4149 transitions. [2024-11-19 14:47:31,315 INFO L332 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2024-11-19 14:47:31,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4018 states and 4149 transitions. [2024-11-19 14:47:31,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 439 [2024-11-19 14:47:31,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:31,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:31,323 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [75, 75, 75, 75, 15, 15, 15, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:47:31,323 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [69, 69, 69, 69, 7, 7, 7, 1, 1, 1] [2024-11-19 14:47:31,323 INFO L745 eck$LassoCheckResult]: Stem: 129020#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 129008#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 129000#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 129001#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 129005#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 129004#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 129002#L33-1 main_~i~0#1 := 0; 129003#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 129524#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 129523#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 129522#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 129521#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 129520#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129519#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129518#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129517#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129516#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 129515#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 129514#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 129513#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 129512#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 129511#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 129510#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129509#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129508#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129507#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129506#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129505#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129504#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129503#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129502#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 129501#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 129500#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 129499#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129498#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129497#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129496#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129495#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129494#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129493#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129492#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129491#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129490#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129489#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129488#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129487#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 129486#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 129485#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 129484#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 129483#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 129482#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 129481#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129480#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129479#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129478#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129477#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129476#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129475#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129474#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129473#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129472#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129471#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129470#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129469#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 129468#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 129467#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 129466#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129465#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129464#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129463#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129462#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129461#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129460#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129459#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129458#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129457#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129456#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129455#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129454#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129453#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129452#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129451#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129450#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 129449#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 129448#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 129447#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129446#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129445#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129444#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129443#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129442#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129441#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129440#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129439#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129438#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129437#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129436#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129435#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129434#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129433#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129432#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129431#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129430#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129429#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129428#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129427#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 129426#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 129425#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 129424#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 129423#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 129422#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 129421#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129420#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129419#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129418#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129417#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129416#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129415#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129414#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129413#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129412#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129411#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129410#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129409#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129408#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129407#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129406#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129405#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 129404#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 129403#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 129402#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129401#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129400#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129399#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129398#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129397#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129396#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129395#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129394#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129393#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129392#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129391#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129390#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129389#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129388#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129387#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129386#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129385#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129384#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129383#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129382#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 129381#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 129380#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 129379#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129378#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129377#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129376#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129375#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129374#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129373#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129372#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129371#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129370#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129369#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129368#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129367#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129366#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129365#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129364#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129363#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129362#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129361#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129360#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129359#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129358#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129357#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129356#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129355#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 129354#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 129353#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 129352#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129351#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129350#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129349#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129348#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129347#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129346#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129345#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129344#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129343#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129342#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129341#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129340#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129339#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129338#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129337#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129336#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129335#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129334#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129333#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129332#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129331#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129330#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129329#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129328#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129325#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129327#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129326#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129324#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 129323#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 129322#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 129320#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 129318#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 129316#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 129314#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129312#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129310#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129308#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129306#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129304#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129302#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129300#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129298#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129296#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129294#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129292#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129290#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129288#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129286#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129284#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129282#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129280#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129278#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129276#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129274#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 129269#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 129265#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 129263#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129261#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129259#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129257#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129255#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129253#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129251#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129249#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129247#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129245#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129243#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129241#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129239#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129237#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129235#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129233#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129231#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129229#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129227#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129225#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129223#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129221#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129219#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129217#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129215#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 129212#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 129210#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 129208#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129206#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129204#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129202#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129200#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129198#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129196#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129194#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129192#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129190#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129188#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129186#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129184#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129182#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129180#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129178#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129176#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129174#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129172#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129170#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129168#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129166#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129164#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129162#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129160#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129158#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129156#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129154#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129152#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 129137#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 129135#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 129133#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129131#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129129#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129127#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129125#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129123#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129121#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129119#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129117#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129115#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129113#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129111#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129109#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129107#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129105#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129103#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129101#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129099#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129097#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129095#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129093#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129091#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129089#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129087#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129085#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129083#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129082#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129080#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129078#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129070#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129074#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129072#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129069#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 129067#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 129065#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 129063#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129062#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129061#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129060#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129059#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129058#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129057#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129056#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129055#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129054#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129053#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129052#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129051#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129050#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129049#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129048#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129047#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129046#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129045#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129044#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129043#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129042#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129041#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129040#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129039#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129038#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129037#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129036#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129035#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129034#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129033#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129032#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129031#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 129028#L18 assume !(0 == __VERIFIER_assert_~cond#1); 129030#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 129029#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129027#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 129021#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 129022#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 129009#L34-2 [2024-11-19 14:47:31,324 INFO L747 eck$LassoCheckResult]: Loop: 129009#L34-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 129010#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 129013#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 129014#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131897#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131895#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131893#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131891#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131889#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131887#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131885#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131883#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131881#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131879#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131877#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131875#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131873#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131871#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131869#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131867#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131865#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131863#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131861#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131860#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131858#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131856#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131853#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131851#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131850#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131849#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131848#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131846#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 131847#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 131991#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 131990#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131989#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131988#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131987#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131986#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131985#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131984#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131983#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131982#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131981#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131980#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131979#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131978#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131977#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131976#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131975#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131974#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131973#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131972#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131971#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131970#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131969#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131968#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131967#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131966#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131965#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131964#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131963#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131962#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131959#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131961#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131960#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131958#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 131957#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 131956#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 131955#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131954#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131953#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131952#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131951#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131950#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131949#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131948#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131947#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131946#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131945#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131944#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131943#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131942#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131941#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131940#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131939#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131938#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131937#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131936#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131935#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131934#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131933#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131932#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131931#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131930#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131929#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131928#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131927#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131926#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131925#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131924#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131923#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131920#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131922#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131921#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131919#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 131918#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 131917#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 131916#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131915#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131914#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131913#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131912#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131911#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131910#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131909#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131908#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131907#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131906#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131905#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131904#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131903#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131902#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131901#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131900#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131899#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131898#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131896#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131894#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131892#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131890#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131888#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131886#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131884#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131882#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131880#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131878#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131876#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131874#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131872#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131870#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131868#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131866#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131864#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131862#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131855#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131859#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131857#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131854#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 131852#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 131707#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 131705#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131704#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131703#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131702#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131701#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131700#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131699#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131698#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131697#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131696#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131695#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131694#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131693#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131692#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131691#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131690#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131689#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131688#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131687#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131686#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131685#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131684#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131683#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131682#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131681#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131680#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131679#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131678#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131677#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131676#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131675#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131674#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131673#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131672#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131671#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131670#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131669#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131668#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131667#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131666#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131588#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131581#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131585#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131583#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131580#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 131579#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 131577#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 131575#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131572#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131570#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131568#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131567#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131566#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131565#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131564#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131563#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131562#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131561#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131560#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131559#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131558#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131557#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131556#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131555#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131554#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131553#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131552#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131551#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131550#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131549#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131548#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131547#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131546#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131545#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131544#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131543#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131542#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131541#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131540#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131539#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131538#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131537#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131536#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131535#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131534#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131533#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131532#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131531#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 131530#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131529#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 131528#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 131527#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 130807#L18 assume !(0 == __VERIFIER_assert_~cond#1); 131526#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 130808#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 130806#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 130804#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 130801#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 129526#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 130776#L18 assume !(0 == __VERIFIER_assert_~cond#1); 130775#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 130156#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 130155#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 130154#L18 assume !(0 == __VERIFIER_assert_~cond#1); 130153#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 130072#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 130071#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 130070#L18 assume !(0 == __VERIFIER_assert_~cond#1); 130069#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 130068#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 130067#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 130066#L18 assume !(0 == __VERIFIER_assert_~cond#1); 130065#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 130064#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 130063#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 130062#L18 assume !(0 == __VERIFIER_assert_~cond#1); 130061#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 130060#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 130059#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 130058#L18 assume !(0 == __VERIFIER_assert_~cond#1); 130057#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 130056#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 130055#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 130054#L18 assume !(0 == __VERIFIER_assert_~cond#1); 130053#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 130052#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 130051#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 130050#L18 assume !(0 == __VERIFIER_assert_~cond#1); 130049#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 130048#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 130047#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 130046#L18 assume !(0 == __VERIFIER_assert_~cond#1); 130045#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 130044#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 130043#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 130042#L18 assume !(0 == __VERIFIER_assert_~cond#1); 130041#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 130040#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 130039#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 130038#L18 assume !(0 == __VERIFIER_assert_~cond#1); 130037#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 130036#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 130035#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 130027#L18 assume !(0 == __VERIFIER_assert_~cond#1); 130034#L18-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 130031#L36-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 130026#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 129527#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 129525#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 129009#L34-2 [2024-11-19 14:47:31,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:31,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1621320925, now seen corresponding path program 26 times [2024-11-19 14:47:31,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:31,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135901625] [2024-11-19 14:47:31,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:47:31,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:31,392 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:47:31,392 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:31,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:31,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:31,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:31,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1430492075, now seen corresponding path program 21 times [2024-11-19 14:47:31,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:31,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107205539] [2024-11-19 14:47:31,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:47:31,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:31,502 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2024-11-19 14:47:31,503 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:47:31,717 INFO L134 CoverageAnalysis]: Checked inductivity of 9937 backedges. 2884 proven. 191 refuted. 0 times theorem prover too weak. 6862 trivial. 0 not checked. [2024-11-19 14:47:31,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:47:31,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107205539] [2024-11-19 14:47:31,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107205539] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:47:31,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078352712] [2024-11-19 14:47:31,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:47:31,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:47:31,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:31,721 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:47:31,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2024-11-19 14:47:31,924 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2024-11-19 14:47:31,924 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:47:31,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-19 14:47:31,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 9937 backedges. 2749 proven. 1089 refuted. 0 times theorem prover too weak. 6099 trivial. 0 not checked. [2024-11-19 14:47:32,450 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:47:33,094 INFO L134 CoverageAnalysis]: Checked inductivity of 9937 backedges. 2884 proven. 276 refuted. 0 times theorem prover too weak. 6777 trivial. 0 not checked. [2024-11-19 14:47:33,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078352712] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:47:33,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:47:33,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 20, 17] total 41 [2024-11-19 14:47:33,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086024170] [2024-11-19 14:47:33,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:47:33,095 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:47:33,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:47:33,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-19 14:47:33,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1458, Unknown=0, NotChecked=0, Total=1722 [2024-11-19 14:47:33,096 INFO L87 Difference]: Start difference. First operand 4018 states and 4149 transitions. cyclomatic complexity: 160 Second operand has 42 states, 41 states have (on average 3.5121951219512195) internal successors, (144), 42 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)