./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-lit/as2013-hybrid.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8be7027f 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-lit/as2013-hybrid.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 6f4877babf2234c4d9f84af37e06b0d1c35e333b586df80a0a3a6ac5b1b8e2d2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 21:26:48,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 21:26:48,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-12 21:26:48,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 21:26:48,234 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 21:26:48,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 21:26:48,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 21:26:48,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 21:26:48,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 21:26:48,262 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 21:26:48,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 21:26:48,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 21:26:48,263 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 21:26:48,264 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-12 21:26:48,264 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-12 21:26:48,264 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-12 21:26:48,265 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-12 21:26:48,265 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-12 21:26:48,265 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-12 21:26:48,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 21:26:48,266 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-12 21:26:48,269 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 21:26:48,269 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 21:26:48,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 21:26:48,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 21:26:48,273 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-12 21:26:48,273 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-12 21:26:48,273 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-12 21:26:48,273 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 21:26:48,274 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 21:26:48,274 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 21:26:48,274 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 21:26:48,274 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-12 21:26:48,274 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 21:26:48,275 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 21:26:48,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 21:26:48,275 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 21:26:48,275 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 21:26:48,276 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-12 21:26:48,276 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 -> 6f4877babf2234c4d9f84af37e06b0d1c35e333b586df80a0a3a6ac5b1b8e2d2 [2024-11-12 21:26:48,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 21:26:48,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 21:26:48,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 21:26:48,541 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 21:26:48,542 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 21:26:48,543 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/as2013-hybrid.i [2024-11-12 21:26:49,969 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 21:26:50,146 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 21:26:50,147 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/as2013-hybrid.i [2024-11-12 21:26:50,157 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08e416e80/516674c951264d3baec2bb6903cc5ce0/FLAGbb6c252d2 [2024-11-12 21:26:50,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08e416e80/516674c951264d3baec2bb6903cc5ce0 [2024-11-12 21:26:50,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 21:26:50,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 21:26:50,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 21:26:50,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 21:26:50,186 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 21:26:50,187 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:26:50" (1/1) ... [2024-11-12 21:26:50,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ec3489b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:50, skipping insertion in model container [2024-11-12 21:26:50,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:26:50" (1/1) ... [2024-11-12 21:26:50,204 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 21:26:50,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 21:26:50,380 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 21:26:50,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 21:26:50,407 INFO L204 MainTranslator]: Completed translation [2024-11-12 21:26:50,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:50 WrapperNode [2024-11-12 21:26:50,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 21:26:50,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 21:26:50,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 21:26:50,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 21:26:50,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:50" (1/1) ... [2024-11-12 21:26:50,421 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:50" (1/1) ... [2024-11-12 21:26:50,435 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 45 [2024-11-12 21:26:50,435 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 21:26:50,436 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 21:26:50,436 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 21:26:50,436 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 21:26:50,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:50" (1/1) ... [2024-11-12 21:26:50,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:50" (1/1) ... [2024-11-12 21:26:50,445 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:50" (1/1) ... [2024-11-12 21:26:50,454 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-12 21:26:50,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:50" (1/1) ... [2024-11-12 21:26:50,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:50" (1/1) ... [2024-11-12 21:26:50,458 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:50" (1/1) ... [2024-11-12 21:26:50,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:50" (1/1) ... [2024-11-12 21:26:50,462 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:50" (1/1) ... [2024-11-12 21:26:50,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:50" (1/1) ... [2024-11-12 21:26:50,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 21:26:50,465 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 21:26:50,465 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 21:26:50,466 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 21:26:50,466 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:50" (1/1) ... [2024-11-12 21:26:50,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:50,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:50,511 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-12 21:26:50,516 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-12 21:26:50,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 21:26:50,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 21:26:50,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 21:26:50,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 21:26:50,628 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 21:26:50,631 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 21:26:50,763 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-12 21:26:50,763 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 21:26:50,779 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 21:26:50,780 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 21:26:50,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:26:50 BoogieIcfgContainer [2024-11-12 21:26:50,781 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 21:26:50,782 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-12 21:26:50,782 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-12 21:26:50,786 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-12 21:26:50,786 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:26:50,786 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.11 09:26:50" (1/3) ... [2024-11-12 21:26:50,787 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@566a45dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:26:50, skipping insertion in model container [2024-11-12 21:26:50,788 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:26:50,788 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:50" (2/3) ... [2024-11-12 21:26:50,789 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@566a45dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:26:50, skipping insertion in model container [2024-11-12 21:26:50,789 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:26:50,789 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:26:50" (3/3) ... [2024-11-12 21:26:50,790 INFO L332 chiAutomizerObserver]: Analyzing ICFG as2013-hybrid.i [2024-11-12 21:26:50,836 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2024-11-12 21:26:50,836 INFO L302 stractBuchiCegarLoop]: Hoare is None [2024-11-12 21:26:50,836 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-12 21:26:50,836 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-12 21:26:50,837 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-12 21:26:50,837 INFO L306 stractBuchiCegarLoop]: Difference is false [2024-11-12 21:26:50,837 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-12 21:26:50,837 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-12 21:26:50,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 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-12 21:26:50,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-11-12 21:26:50,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:26:50,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:26:50,857 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:26:50,858 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-12 21:26:50,858 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-12 21:26:50,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 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-12 21:26:50,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-11-12 21:26:50,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:26:50,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:26:50,860 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:26:50,860 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-12 21:26:50,866 INFO L747 eck$LassoCheckResult]: Stem: "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(12, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~post2#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0;" [2024-11-12 21:26:50,866 INFO L749 eck$LassoCheckResult]: Loop: "assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0;" "assume !(main_~j~0#1 < 10);" "assume main_~i~0#1 > 9;main_~i~0#1 := 0;" "havoc main_~j~0#1;" [2024-11-12 21:26:50,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:50,871 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-12 21:26:50,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:50,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389222377] [2024-11-12 21:26:50,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:50,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:50,960 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:50,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:50,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:50,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1270380, now seen corresponding path program 1 times [2024-11-12 21:26:50,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:50,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357105074] [2024-11-12 21:26:50,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:50,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:51,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:26:51,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357105074] [2024-11-12 21:26:51,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357105074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:26:51,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003466956] [2024-11-12 21:26:51,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:51,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:26:51,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:51,062 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:26:51,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 21:26:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:51,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:26:51,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:51,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:26:51,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003466956] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:26:51,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:26:51,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 3 [2024-11-12 21:26:51,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408431990] [2024-11-12 21:26:51,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:26:51,134 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:26:51,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:26:51,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 21:26:51,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 21:26:51,162 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 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 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-12 21:26:51,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:26:51,194 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2024-11-12 21:26:51,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2024-11-12 21:26:51,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-11-12 21:26:51,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 16 states and 18 transitions. [2024-11-12 21:26:51,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-12 21:26:51,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-12 21:26:51,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2024-11-12 21:26:51,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:26:51,201 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-12 21:26:51,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2024-11-12 21:26:51,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-12 21:26:51,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 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-12 21:26:51,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-11-12 21:26:51,220 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-12 21:26:51,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 21:26:51,224 INFO L426 stractBuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-12 21:26:51,224 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-12 21:26:51,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2024-11-12 21:26:51,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-11-12 21:26:51,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:26:51,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:26:51,226 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:26:51,226 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-12 21:26:51,226 INFO L747 eck$LassoCheckResult]: Stem: "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(12, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~post2#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0;" [2024-11-12 21:26:51,226 INFO L749 eck$LassoCheckResult]: Loop: "assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~j~0#1 < 10);" "assume main_~i~0#1 > 9;main_~i~0#1 := 0;" "havoc main_~j~0#1;" [2024-11-12 21:26:51,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:51,227 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-12 21:26:51,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:51,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954813854] [2024-11-12 21:26:51,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:51,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:51,234 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:51,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:51,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:51,239 INFO L85 PathProgramCache]: Analyzing trace with hash -552488980, now seen corresponding path program 1 times [2024-11-12 21:26:51,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:51,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599713282] [2024-11-12 21:26:51,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:51,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:51,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:26:51,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599713282] [2024-11-12 21:26:51,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599713282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:26:51,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957139203] [2024-11-12 21:26:51,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:51,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:26:51,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:51,359 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:26:51,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 21:26:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:51,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 21:26:51,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:51,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:26:51,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957139203] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:26:51,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:26:51,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-12 21:26:51,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774572251] [2024-11-12 21:26:51,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:26:51,563 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:26:51,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:26:51,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 21:26:51,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-12 21:26:51,564 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 3 Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 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-12 21:26:51,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:26:51,600 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-11-12 21:26:51,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 38 transitions. [2024-11-12 21:26:51,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2024-11-12 21:26:51,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 38 transitions. [2024-11-12 21:26:51,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-12 21:26:51,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-11-12 21:26:51,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 38 transitions. [2024-11-12 21:26:51,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:26:51,603 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-11-12 21:26:51,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 38 transitions. [2024-11-12 21:26:51,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-12 21:26:51,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 35 states have internal predecessors, (38), 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-12 21:26:51,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2024-11-12 21:26:51,607 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-11-12 21:26:51,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 21:26:51,608 INFO L426 stractBuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-11-12 21:26:51,608 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-12 21:26:51,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 38 transitions. [2024-11-12 21:26:51,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2024-11-12 21:26:51,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:26:51,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:26:51,610 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:26:51,610 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 6, 6, 6, 1, 1, 1, 1] [2024-11-12 21:26:51,610 INFO L747 eck$LassoCheckResult]: Stem: "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(12, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~post2#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0;" [2024-11-12 21:26:51,610 INFO L749 eck$LassoCheckResult]: Loop: "assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~j~0#1 < 10);" "assume main_~i~0#1 > 9;main_~i~0#1 := 0;" "havoc main_~j~0#1;" [2024-11-12 21:26:51,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:51,611 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-12 21:26:51,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:51,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119690042] [2024-11-12 21:26:51,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:51,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:51,621 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:51,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:51,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:51,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1761760532, now seen corresponding path program 2 times [2024-11-12 21:26:51,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:51,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716356790] [2024-11-12 21:26:51,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:51,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:51,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:26:51,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716356790] [2024-11-12 21:26:51,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716356790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:26:51,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039591321] [2024-11-12 21:26:51,914 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 21:26:51,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:26:51,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:51,918 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:26:51,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 21:26:51,972 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 21:26:51,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 21:26:51,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-11-12 21:26:51,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937056695] [2024-11-12 21:26:51,975 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 21:26:51,976 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:26:51,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:26:51,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 21:26:51,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-12 21:26:51,977 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. cyclomatic complexity: 3 Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 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-12 21:26:52,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:26:52,022 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2024-11-12 21:26:52,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 47 transitions. [2024-11-12 21:26:52,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2024-11-12 21:26:52,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 47 transitions. [2024-11-12 21:26:52,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2024-11-12 21:26:52,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2024-11-12 21:26:52,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 47 transitions. [2024-11-12 21:26:52,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:26:52,026 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 47 transitions. [2024-11-12 21:26:52,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 47 transitions. [2024-11-12 21:26:52,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2024-11-12 21:26:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.048780487804878) internal successors, (43), 40 states have internal predecessors, (43), 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-12 21:26:52,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2024-11-12 21:26:52,030 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 43 transitions. [2024-11-12 21:26:52,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 21:26:52,031 INFO L426 stractBuchiCegarLoop]: Abstraction has 41 states and 43 transitions. [2024-11-12 21:26:52,032 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-12 21:26:52,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 43 transitions. [2024-11-12 21:26:52,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2024-11-12 21:26:52,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:26:52,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:26:52,036 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:26:52,036 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 7, 7, 7, 1, 1, 1, 1] [2024-11-12 21:26:52,036 INFO L747 eck$LassoCheckResult]: Stem: "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(12, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~post2#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0;" [2024-11-12 21:26:52,036 INFO L749 eck$LassoCheckResult]: Loop: "assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~j~0#1 < 10);" "assume main_~i~0#1 > 9;main_~i~0#1 := 0;" "havoc main_~j~0#1;" [2024-11-12 21:26:52,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:52,037 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-12 21:26:52,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:52,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403883405] [2024-11-12 21:26:52,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:52,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:52,045 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:52,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:52,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:52,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1705272984, now seen corresponding path program 3 times [2024-11-12 21:26:52,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:52,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225220673] [2024-11-12 21:26:52,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:52,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:52,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:26:52,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225220673] [2024-11-12 21:26:52,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225220673] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:26:52,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182022388] [2024-11-12 21:26:52,289 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 21:26:52,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:26:52,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:52,293 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:26:52,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 21:26:52,339 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 21:26:52,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 21:26:52,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-11-12 21:26:52,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436617744] [2024-11-12 21:26:52,340 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 21:26:52,340 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:26:52,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:26:52,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 21:26:52,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-11-12 21:26:52,342 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. cyclomatic complexity: 3 Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 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-12 21:26:52,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:26:52,379 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2024-11-12 21:26:52,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 52 transitions. [2024-11-12 21:26:52,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2024-11-12 21:26:52,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 52 transitions. [2024-11-12 21:26:52,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2024-11-12 21:26:52,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2024-11-12 21:26:52,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 52 transitions. [2024-11-12 21:26:52,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:26:52,387 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 52 transitions. [2024-11-12 21:26:52,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 52 transitions. [2024-11-12 21:26:52,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2024-11-12 21:26:52,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 45 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-12 21:26:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2024-11-12 21:26:52,393 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 48 transitions. [2024-11-12 21:26:52,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 21:26:52,395 INFO L426 stractBuchiCegarLoop]: Abstraction has 46 states and 48 transitions. [2024-11-12 21:26:52,396 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-12 21:26:52,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 48 transitions. [2024-11-12 21:26:52,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2024-11-12 21:26:52,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:26:52,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:26:52,399 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:26:52,399 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 8, 8, 8, 1, 1, 1, 1] [2024-11-12 21:26:52,399 INFO L747 eck$LassoCheckResult]: Stem: "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(12, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~post2#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0;" [2024-11-12 21:26:52,400 INFO L749 eck$LassoCheckResult]: Loop: "assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~j~0#1 < 10);" "assume main_~i~0#1 > 9;main_~i~0#1 := 0;" "havoc main_~j~0#1;" [2024-11-12 21:26:52,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:52,401 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-12 21:26:52,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:52,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194362943] [2024-11-12 21:26:52,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:52,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:52,409 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:52,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:52,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:52,416 INFO L85 PathProgramCache]: Analyzing trace with hash 505108588, now seen corresponding path program 4 times [2024-11-12 21:26:52,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:52,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007782804] [2024-11-12 21:26:52,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:52,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:52,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:26:52,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007782804] [2024-11-12 21:26:52,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007782804] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:26:52,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054160572] [2024-11-12 21:26:52,642 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 21:26:52,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:26:52,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:52,644 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:26:52,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 21:26:52,687 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 21:26:52,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 21:26:52,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-11-12 21:26:52,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798735385] [2024-11-12 21:26:52,688 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 21:26:52,689 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:26:52,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:26:52,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 21:26:52,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-12 21:26:52,690 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. cyclomatic complexity: 3 Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 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-12 21:26:52,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:26:52,731 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2024-11-12 21:26:52,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 57 transitions. [2024-11-12 21:26:52,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 53 [2024-11-12 21:26:52,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 57 transitions. [2024-11-12 21:26:52,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2024-11-12 21:26:52,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2024-11-12 21:26:52,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 57 transitions. [2024-11-12 21:26:52,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:26:52,735 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 57 transitions. [2024-11-12 21:26:52,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 57 transitions. [2024-11-12 21:26:52,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2024-11-12 21:26:52,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 50 states have internal predecessors, (53), 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-12 21:26:52,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2024-11-12 21:26:52,740 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 53 transitions. [2024-11-12 21:26:52,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 21:26:52,741 INFO L426 stractBuchiCegarLoop]: Abstraction has 51 states and 53 transitions. [2024-11-12 21:26:52,741 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-12 21:26:52,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 53 transitions. [2024-11-12 21:26:52,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2024-11-12 21:26:52,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:26:52,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:26:52,743 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:26:52,743 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 9, 9, 9, 1, 1, 1, 1] [2024-11-12 21:26:52,743 INFO L747 eck$LassoCheckResult]: Stem: "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(12, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~post2#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0;" [2024-11-12 21:26:52,743 INFO L749 eck$LassoCheckResult]: Loop: "assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~j~0#1 < 10);" "assume main_~i~0#1 > 9;main_~i~0#1 := 0;" "havoc main_~j~0#1;" [2024-11-12 21:26:52,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:52,744 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-11-12 21:26:52,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:52,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653297983] [2024-11-12 21:26:52,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:52,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:52,749 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:52,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:52,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:52,752 INFO L85 PathProgramCache]: Analyzing trace with hash 237919208, now seen corresponding path program 5 times [2024-11-12 21:26:52,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:52,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24847929] [2024-11-12 21:26:52,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:52,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:52,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:26:52,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24847929] [2024-11-12 21:26:52,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24847929] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:26:52,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439724408] [2024-11-12 21:26:52,985 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-12 21:26:52,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:26:52,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:52,988 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:26:52,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 21:26:53,036 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 21:26:53,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 21:26:53,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-11-12 21:26:53,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746633257] [2024-11-12 21:26:53,038 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 21:26:53,038 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:26:53,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:26:53,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 21:26:53,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-12 21:26:53,039 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. cyclomatic complexity: 3 Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 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-12 21:26:53,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:26:53,080 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2024-11-12 21:26:53,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 58 transitions. [2024-11-12 21:26:53,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 54 [2024-11-12 21:26:53,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 56 states and 58 transitions. [2024-11-12 21:26:53,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2024-11-12 21:26:53,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2024-11-12 21:26:53,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 58 transitions. [2024-11-12 21:26:53,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:26:53,084 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 58 transitions. [2024-11-12 21:26:53,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 58 transitions. [2024-11-12 21:26:53,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-12 21:26:53,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 55 states have internal predecessors, (58), 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-12 21:26:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2024-11-12 21:26:53,091 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 58 transitions. [2024-11-12 21:26:53,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 21:26:53,092 INFO L426 stractBuchiCegarLoop]: Abstraction has 56 states and 58 transitions. [2024-11-12 21:26:53,092 INFO L333 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-12 21:26:53,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 58 transitions. [2024-11-12 21:26:53,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 54 [2024-11-12 21:26:53,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:26:53,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:26:53,094 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:26:53,094 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 10, 10, 10, 1, 1, 1, 1] [2024-11-12 21:26:53,094 INFO L747 eck$LassoCheckResult]: Stem: "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(12, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~post2#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0;" [2024-11-12 21:26:53,094 INFO L749 eck$LassoCheckResult]: Loop: "assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~j~0#1 < 10);" "assume main_~i~0#1 > 9;main_~i~0#1 := 0;" "havoc main_~j~0#1;" [2024-11-12 21:26:53,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:53,095 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-11-12 21:26:53,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:53,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515674762] [2024-11-12 21:26:53,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:53,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:53,099 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:53,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:53,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:53,102 INFO L85 PathProgramCache]: Analyzing trace with hash 605955564, now seen corresponding path program 6 times [2024-11-12 21:26:53,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:53,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898737030] [2024-11-12 21:26:53,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:53,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:53,127 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:53,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:53,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:53,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1929806894, now seen corresponding path program 1 times [2024-11-12 21:26:53,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:53,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131830424] [2024-11-12 21:26:53,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:53,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:53,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:26:53,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131830424] [2024-11-12 21:26:53,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131830424] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:26:53,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759245149] [2024-11-12 21:26:53,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:53,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:26:53,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:53,240 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:26:53,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-12 21:26:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:53,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 21:26:53,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:53,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:26:53,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759245149] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:26:53,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:26:53,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-12 21:26:53,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084558494] [2024-11-12 21:26:53,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:26:54,343 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:26:54,344 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:26:54,344 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:26:54,344 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:26:54,344 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-12 21:26:54,345 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:54,345 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:26:54,345 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:26:54,345 INFO L132 ssoRankerPreferences]: Filename of dumped script: as2013-hybrid.i_Iteration7_Loop [2024-11-12 21:26:54,345 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:26:54,345 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:26:54,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:54,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:54,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:54,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:54,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:54,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:54,415 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:26:54,416 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-12 21:26:54,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:54,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:54,420 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-12 21:26:54,421 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-12 21:26:54,424 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:54,424 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:54,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-12 21:26:54,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:54,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:54,458 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-12 21:26:54,460 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-12 21:26:54,461 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-12 21:26:54,461 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:54,482 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-12 21:26:54,498 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-12 21:26:54,501 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:26:54,501 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:26:54,502 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:26:54,502 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:26:54,502 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 21:26:54,502 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:54,502 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:26:54,502 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:26:54,502 INFO L132 ssoRankerPreferences]: Filename of dumped script: as2013-hybrid.i_Iteration7_Loop [2024-11-12 21:26:54,502 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:26:54,502 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:26:54,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:54,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:54,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:54,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:54,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:54,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:54,549 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:26:54,553 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 21:26:54,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:54,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:54,555 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-12 21:26:54,557 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-12 21:26:54,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-12 21:26:54,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:54,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:54,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:54,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:54,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:54,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:54,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:54,576 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 21:26:54,580 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-12 21:26:54,580 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-12 21:26:54,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:54,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:54,584 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-12 21:26:54,596 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-12 21:26:54,598 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 21:26:54,598 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-12 21:26:54,599 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 21:26:54,599 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-12 21:26:54,613 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-12 21:26:54,615 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-12 21:26:54,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:54,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:26:54,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:54,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 21:26:54,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-12 21:26:54,806 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-12 21:26:54,807 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 58 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-12 21:26:54,852 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 58 transitions. cyclomatic complexity: 3. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 169 states and 175 transitions. Complement of second has 7 states. [2024-11-12 21:26:54,856 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-12 21:26:54,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-12 21:26:54,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2024-11-12 21:26:54,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 54 letters. [2024-11-12 21:26:54,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:54,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 56 letters. Loop has 54 letters. [2024-11-12 21:26:54,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:54,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 108 letters. [2024-11-12 21:26:54,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:54,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 175 transitions. [2024-11-12 21:26:54,868 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2024-11-12 21:26:54,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 167 states and 173 transitions. [2024-11-12 21:26:54,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2024-11-12 21:26:54,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2024-11-12 21:26:54,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 173 transitions. [2024-11-12 21:26:54,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:26:54,873 INFO L218 hiAutomatonCegarLoop]: Abstraction has 167 states and 173 transitions. [2024-11-12 21:26:54,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 173 transitions. [2024-11-12 21:26:54,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2024-11-12 21:26:54,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 164 states have (on average 1.0365853658536586) internal successors, (170), 163 states have internal predecessors, (170), 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-12 21:26:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 170 transitions. [2024-11-12 21:26:54,886 INFO L240 hiAutomatonCegarLoop]: Abstraction has 164 states and 170 transitions. [2024-11-12 21:26:54,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:26:54,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 21:26:54,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-12 21:26:54,888 INFO L87 Difference]: Start difference. First operand 164 states and 170 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-12 21:26:54,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:26:54,924 INFO L93 Difference]: Finished difference Result 323 states and 330 transitions. [2024-11-12 21:26:54,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 323 states and 330 transitions. [2024-11-12 21:26:54,926 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 221 [2024-11-12 21:26:54,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 323 states to 271 states and 277 transitions. [2024-11-12 21:26:54,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 271 [2024-11-12 21:26:54,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 271 [2024-11-12 21:26:54,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 271 states and 277 transitions. [2024-11-12 21:26:54,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:26:54,929 INFO L218 hiAutomatonCegarLoop]: Abstraction has 271 states and 277 transitions. [2024-11-12 21:26:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states and 277 transitions. [2024-11-12 21:26:54,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 218. [2024-11-12 21:26:54,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 218 states have (on average 1.0229357798165137) internal successors, (223), 217 states have internal predecessors, (223), 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-12 21:26:54,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 223 transitions. [2024-11-12 21:26:54,938 INFO L240 hiAutomatonCegarLoop]: Abstraction has 218 states and 223 transitions. [2024-11-12 21:26:54,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 21:26:54,939 INFO L426 stractBuchiCegarLoop]: Abstraction has 218 states and 223 transitions. [2024-11-12 21:26:54,939 INFO L333 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-12 21:26:54,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 218 states and 223 transitions. [2024-11-12 21:26:54,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 216 [2024-11-12 21:26:54,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:26:54,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:26:54,942 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:26:54,942 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [40, 40, 40, 40, 40, 4, 4, 4, 3, 1] [2024-11-12 21:26:54,942 INFO L747 eck$LassoCheckResult]: Stem: "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(12, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~post2#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0;" [2024-11-12 21:26:54,943 INFO L749 eck$LassoCheckResult]: Loop: "assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~j~0#1 < 10);" "assume !(main_~i~0#1 > 9);" "havoc main_~j~0#1;" "assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~j~0#1 < 10);" "assume !(main_~i~0#1 > 9);" "havoc main_~j~0#1;" "assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~j~0#1 < 10);" "assume !(main_~i~0#1 > 9);" "havoc main_~j~0#1;" "assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~j~0#1 < 10);" "assume main_~i~0#1 > 9;main_~i~0#1 := 0;" "havoc main_~j~0#1;" [2024-11-12 21:26:54,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:54,943 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2024-11-12 21:26:54,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:54,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867973763] [2024-11-12 21:26:54,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:54,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:54,947 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:54,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:54,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:54,950 INFO L85 PathProgramCache]: Analyzing trace with hash -41171993, now seen corresponding path program 1 times [2024-11-12 21:26:54,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:54,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569600270] [2024-11-12 21:26:54,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:54,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:55,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-12 21:26:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:55,032 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:55,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:55,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:55,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1851788887, now seen corresponding path program 1 times [2024-11-12 21:26:55,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:55,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643576342] [2024-11-12 21:26:55,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:55,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:55,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:26:55,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643576342] [2024-11-12 21:26:55,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643576342] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:26:55,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126850939] [2024-11-12 21:26:55,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:55,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:26:55,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:55,430 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:26:55,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-12 21:26:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:55,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 21:26:55,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:55,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:26:56,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126850939] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:26:56,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:26:56,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-12 21:26:56,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009308384] [2024-11-12 21:26:56,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:27:01,406 WARN L286 SmtUtils]: Spent 5.08s on a formula simplification. DAG size of input: 692 DAG size of output: 487 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-12 21:27:03,875 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:27:03,875 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:27:03,875 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:27:03,876 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:27:03,876 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-12 21:27:03,876 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:03,876 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:27:03,876 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:27:03,876 INFO L132 ssoRankerPreferences]: Filename of dumped script: as2013-hybrid.i_Iteration8_Loop [2024-11-12 21:27:03,876 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:27:03,876 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:27:03,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:03,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:03,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:03,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:03,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:03,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:03,917 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:27:03,917 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-12 21:27:03,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:03,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:03,920 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-12 21:27:03,924 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-12 21:27:03,925 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:27:03,925 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:03,944 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:27:03,944 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-12 21:27:03,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-12 21:27:03,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:03,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:03,959 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-12 21:27:03,962 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-12 21:27:03,962 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:27:03,962 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:03,979 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:27:03,979 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post2#1=0} Honda state: {ULTIMATE.start_main_#t~post2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-12 21:27:03,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-12 21:27:03,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:03,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:03,992 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-12 21:27:03,994 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-12 21:27:03,995 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:27:03,995 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:04,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-12 21:27:04,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:04,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:04,019 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-12 21:27:04,020 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-12 21:27:04,021 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-12 21:27:04,021 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:04,036 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-12 21:27:04,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-12 21:27:04,052 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:27:04,052 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:27:04,052 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:27:04,052 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:27:04,053 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 21:27:04,053 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:04,053 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:27:04,053 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:27:04,053 INFO L132 ssoRankerPreferences]: Filename of dumped script: as2013-hybrid.i_Iteration8_Loop [2024-11-12 21:27:04,053 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:27:04,053 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:27:04,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:04,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:04,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:04,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:04,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:04,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:04,090 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:27:04,090 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 21:27:04,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:04,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:04,092 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-12 21:27:04,093 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-12 21:27:04,093 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-12 21:27:04,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:27:04,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:27:04,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:27:04,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:27:04,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:27:04,104 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:27:04,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:27:04,105 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:27:04,116 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-12 21:27:04,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:04,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:04,117 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-12 21:27:04,119 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-12 21:27:04,120 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-12 21:27:04,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:27:04,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:27:04,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:27:04,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:27:04,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:27:04,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:27:04,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:27:04,131 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:27:04,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-12 21:27:04,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:04,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:04,144 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-12 21:27:04,146 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-12 21:27:04,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-12 21:27:04,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:27:04,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:27:04,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:27:04,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:27:04,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:27:04,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:27:04,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:27:04,158 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:27:04,170 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-12 21:27:04,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:04,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:04,171 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-12 21:27:04,173 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-12 21:27:04,173 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-12 21:27:04,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:27:04,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:27:04,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:27:04,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:27:04,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:27:04,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:27:04,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:27:04,185 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:27:04,196 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-12 21:27:04,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:04,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:04,198 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-12 21:27:04,199 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-12 21:27:04,200 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-12 21:27:04,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:27:04,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:27:04,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:27:04,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:27:04,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:27:04,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:27:04,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:27:04,212 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:27:04,224 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-12 21:27:04,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:04,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:04,226 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-12 21:27:04,228 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-12 21:27:04,229 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-12 21:27:04,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:27:04,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:27:04,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:27:04,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:27:04,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:27:04,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:27:04,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:27:04,242 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 21:27:04,244 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-12 21:27:04,244 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-12 21:27:04,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:04,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:04,261 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-12 21:27:04,262 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-12 21:27:04,263 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 21:27:04,263 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-12 21:27:04,263 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 21:27:04,263 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-12 21:27:04,274 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-12 21:27:04,274 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-12 21:27:04,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:04,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:27:04,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:04,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 21:27:04,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:04,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4084 backedges. 3 proven. 3141 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2024-11-12 21:27:04,761 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-12 21:27:04,762 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 218 states and 223 transitions. cyclomatic complexity: 6 Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-12 21:27:04,840 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 218 states and 223 transitions. cyclomatic complexity: 6. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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 655 states and 670 transitions. Complement of second has 13 states. [2024-11-12 21:27:04,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2024-11-12 21:27:04,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-12 21:27:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2024-11-12 21:27:04,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 2 letters. Loop has 216 letters. [2024-11-12 21:27:04,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:04,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 218 letters. Loop has 216 letters. [2024-11-12 21:27:04,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:04,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 2 letters. Loop has 432 letters. [2024-11-12 21:27:04,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:04,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 655 states and 670 transitions. [2024-11-12 21:27:04,850 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 236 [2024-11-12 21:27:04,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 655 states to 653 states and 668 transitions. [2024-11-12 21:27:04,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 435 [2024-11-12 21:27:04,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 437 [2024-11-12 21:27:04,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 653 states and 668 transitions. [2024-11-12 21:27:04,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:27:04,854 INFO L218 hiAutomatonCegarLoop]: Abstraction has 653 states and 668 transitions. [2024-11-12 21:27:04,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states and 668 transitions. [2024-11-12 21:27:04,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 488. [2024-11-12 21:27:04,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 488 states have (on average 1.0245901639344261) internal successors, (500), 487 states have internal predecessors, (500), 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-12 21:27:04,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 500 transitions. [2024-11-12 21:27:04,875 INFO L240 hiAutomatonCegarLoop]: Abstraction has 488 states and 500 transitions. [2024-11-12 21:27:04,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:27:04,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 21:27:04,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-12 21:27:04,876 INFO L87 Difference]: Start difference. First operand 488 states and 500 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 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-12 21:27:04,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:27:04,941 INFO L93 Difference]: Finished difference Result 971 states and 990 transitions. [2024-11-12 21:27:04,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 971 states and 990 transitions. [2024-11-12 21:27:04,948 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 560 [2024-11-12 21:27:04,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 971 states to 757 states and 772 transitions. [2024-11-12 21:27:04,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 757 [2024-11-12 21:27:04,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 757 [2024-11-12 21:27:04,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 757 states and 772 transitions. [2024-11-12 21:27:04,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:27:04,954 INFO L218 hiAutomatonCegarLoop]: Abstraction has 757 states and 772 transitions. [2024-11-12 21:27:04,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states and 772 transitions. [2024-11-12 21:27:04,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 542. [2024-11-12 21:27:04,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 542 states have (on average 1.0202952029520296) internal successors, (553), 541 states have internal predecessors, (553), 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-12 21:27:04,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 553 transitions. [2024-11-12 21:27:04,963 INFO L240 hiAutomatonCegarLoop]: Abstraction has 542 states and 553 transitions. [2024-11-12 21:27:04,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 21:27:04,965 INFO L426 stractBuchiCegarLoop]: Abstraction has 542 states and 553 transitions. [2024-11-12 21:27:04,966 INFO L333 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-12 21:27:04,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 542 states and 553 transitions. [2024-11-12 21:27:04,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 540 [2024-11-12 21:27:04,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:27:04,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:27:04,973 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:27:04,973 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [100, 100, 100, 100, 100, 10, 10, 10, 9, 1] [2024-11-12 21:27:04,973 INFO L747 eck$LassoCheckResult]: Stem: "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(12, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~post2#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0;" [2024-11-12 21:27:04,974 INFO L749 eck$LassoCheckResult]: Loop: "assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~j~0#1 < 10);" "assume !(main_~i~0#1 > 9);" "havoc main_~j~0#1;" "assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~j~0#1 < 10);" "assume !(main_~i~0#1 > 9);" "havoc main_~j~0#1;" "assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~j~0#1 < 10);" "assume !(main_~i~0#1 > 9);" "havoc main_~j~0#1;" "assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~j~0#1 < 10);" "assume !(main_~i~0#1 > 9);" "havoc main_~j~0#1;" "assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~j~0#1 < 10);" "assume !(main_~i~0#1 > 9);" "havoc main_~j~0#1;" "assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~j~0#1 < 10);" "assume !(main_~i~0#1 > 9);" "havoc main_~j~0#1;" "assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~j~0#1 < 10);" "assume !(main_~i~0#1 > 9);" "havoc main_~j~0#1;" "assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~j~0#1 < 10);" "assume !(main_~i~0#1 > 9);" "havoc main_~j~0#1;" "assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~j~0#1 < 10);" "assume !(main_~i~0#1 > 9);" "havoc main_~j~0#1;" "assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~j~0#1 < 10);" "assume main_~i~0#1 > 9;main_~i~0#1 := 0;" "havoc main_~j~0#1;" [2024-11-12 21:27:04,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:04,975 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2024-11-12 21:27:04,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:04,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082396621] [2024-11-12 21:27:04,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:04,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:04,979 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:04,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:04,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:04,982 INFO L85 PathProgramCache]: Analyzing trace with hash 88662941, now seen corresponding path program 2 times [2024-11-12 21:27:04,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:04,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769658243] [2024-11-12 21:27:04,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:04,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:05,064 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:05,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:05,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:05,146 INFO L85 PathProgramCache]: Analyzing trace with hash -817295265, now seen corresponding path program 2 times [2024-11-12 21:27:05,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:05,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778374481] [2024-11-12 21:27:05,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:05,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:05,231 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:05,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:05,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-12 21:27:37,011 WARN L286 SmtUtils]: Spent 31.52s on a formula simplification. DAG size of input: 1718 DAG size of output: 1202 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-12 21:27:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:49,710 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:49,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.11 09:27:49 BoogieIcfgContainer [2024-11-12 21:27:49,847 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-12 21:27:49,847 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 21:27:49,847 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 21:27:49,848 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 21:27:49,848 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:26:50" (3/4) ... [2024-11-12 21:27:49,850 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-12 21:27:49,966 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 21:27:49,966 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 21:27:49,967 INFO L158 Benchmark]: Toolchain (without parser) took 59786.51ms. Allocated memory was 167.8MB in the beginning and 822.1MB in the end (delta: 654.3MB). Free memory was 140.1MB in the beginning and 354.0MB in the end (delta: -214.0MB). Peak memory consumption was 440.0MB. Max. memory is 16.1GB. [2024-11-12 21:27:49,968 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory is still 90.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 21:27:49,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.37ms. Allocated memory is still 167.8MB. Free memory was 139.4MB in the beginning and 127.5MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 21:27:49,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.17ms. Allocated memory is still 167.8MB. Free memory was 127.5MB in the beginning and 126.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 21:27:49,968 INFO L158 Benchmark]: Boogie Preprocessor took 28.64ms. Allocated memory is still 167.8MB. Free memory was 126.1MB in the beginning and 124.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 21:27:49,969 INFO L158 Benchmark]: RCFGBuilder took 316.35ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 114.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 21:27:49,969 INFO L158 Benchmark]: BuchiAutomizer took 59064.52ms. Allocated memory was 167.8MB in the beginning and 822.1MB in the end (delta: 654.3MB). Free memory was 114.2MB in the beginning and 369.8MB in the end (delta: -255.6MB). Peak memory consumption was 398.0MB. Max. memory is 16.1GB. [2024-11-12 21:27:49,969 INFO L158 Benchmark]: Witness Printer took 118.98ms. Allocated memory is still 822.1MB. Free memory was 369.8MB in the beginning and 354.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 21:27:49,971 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory is still 90.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.37ms. Allocated memory is still 167.8MB. Free memory was 139.4MB in the beginning and 127.5MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.17ms. Allocated memory is still 167.8MB. Free memory was 127.5MB in the beginning and 126.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.64ms. Allocated memory is still 167.8MB. Free memory was 126.1MB in the beginning and 124.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 316.35ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 114.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 59064.52ms. Allocated memory was 167.8MB in the beginning and 822.1MB in the end (delta: 654.3MB). Free memory was 114.2MB in the beginning and 369.8MB in the end (delta: -255.6MB). Peak memory consumption was 398.0MB. Max. memory is 16.1GB. * Witness Printer took 118.98ms. Allocated memory is still 822.1MB. Free memory was 369.8MB in the beginning and 354.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (8 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 7 locations. 8 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 542 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 58.8s and 9 iterations. TraceHistogramMax:100. Analysis of lassos took 57.4s. Construction of modules took 0.2s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 8. Minimization of nondet autom 2. Automata minimization 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 448 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1178/4319 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 331 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 329 mSDsluCounter, 378 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 281 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 247 IncrementalHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 97 mSDtfsCounter, 247 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI6 SFLT0 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital8 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq200 hnf87 smp100 dnf100 smp100 tf114 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 45ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 16]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L15] int i = 0; VAL [i=0] Loop: [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND TRUE i > 9 [L25] i = 0 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 16]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int i = 0; VAL [i=0] Loop: [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND TRUE i > 9 [L25] i = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-12 21:27:50,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-12 21:27:50,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-12 21:27:50,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-12 21:27:50,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-12 21:27:50,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 21:27:51,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 21:27:51,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 21:27:51,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 21:27:51,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)