./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-lit/as2013-hybrid.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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.3.0-?-c00e63d-m [2025-02-06 19:33:22,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:33:22,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-06 19:33:22,363 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:33:22,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:33:22,364 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:33:22,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:33:22,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:33:22,391 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:33:22,392 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:33:22,392 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:33:22,393 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:33:22,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:33:22,393 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:33:22,393 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:33:22,393 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:33:22,394 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:33:22,394 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:33:22,394 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:33:22,394 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:33:22,395 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:33:22,395 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:33:22,395 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 19:33:22,395 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:33:22,395 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 19:33:22,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:33:22,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:33:22,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:33:22,395 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:33:22,395 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:33:22,396 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 19:33:22,396 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:33:22,396 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:33:22,396 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:33:22,396 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:33:22,396 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:33:22,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:33:22,396 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:33:22,396 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:33:22,396 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:33:22,396 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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-jdk21/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 [2025-02-06 19:33:22,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:33:22,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:33:22,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:33:22,741 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:33:22,741 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:33:22,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/as2013-hybrid.i [2025-02-06 19:33:23,955 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/639fb4c2e/9162054d8d2d4e829de84f58bf8a3ecf/FLAGefbcdff88 [2025-02-06 19:33:24,185 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:33:24,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-lit/as2013-hybrid.i [2025-02-06 19:33:24,191 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/639fb4c2e/9162054d8d2d4e829de84f58bf8a3ecf/FLAGefbcdff88 [2025-02-06 19:33:24,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/639fb4c2e/9162054d8d2d4e829de84f58bf8a3ecf [2025-02-06 19:33:24,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:33:24,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:33:24,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:33:24,511 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:33:24,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:33:24,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:33:24" (1/1) ... [2025-02-06 19:33:24,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54c292c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:33:24, skipping insertion in model container [2025-02-06 19:33:24,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:33:24" (1/1) ... [2025-02-06 19:33:24,530 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:33:24,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:33:24,663 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:33:24,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:33:24,688 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:33:24,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:33:24 WrapperNode [2025-02-06 19:33:24,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:33:24,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:33:24,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:33:24,690 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:33:24,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:33:24" (1/1) ... [2025-02-06 19:33:24,702 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:33:24" (1/1) ... [2025-02-06 19:33:24,712 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 39 [2025-02-06 19:33:24,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:33:24,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:33:24,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:33:24,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:33:24,717 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:33:24" (1/1) ... [2025-02-06 19:33:24,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:33:24" (1/1) ... [2025-02-06 19:33:24,718 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:33:24" (1/1) ... [2025-02-06 19:33:24,725 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]. [2025-02-06 19:33:24,725 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:33:24" (1/1) ... [2025-02-06 19:33:24,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:33:24" (1/1) ... [2025-02-06 19:33:24,727 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:33:24" (1/1) ... [2025-02-06 19:33:24,728 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:33:24" (1/1) ... [2025-02-06 19:33:24,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:33:24" (1/1) ... [2025-02-06 19:33:24,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:33:24" (1/1) ... [2025-02-06 19:33:24,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:33:24,731 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:33:24,731 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:33:24,731 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:33:24,731 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:33:24" (1/1) ... [2025-02-06 19:33:24,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:24,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:24,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:24,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-06 19:33:24,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 19:33:24,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 19:33:24,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:33:24,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:33:24,822 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:33:24,824 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:33:24,909 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-02-06 19:33:24,909 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:33:24,915 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:33:24,915 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:33:24,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:33:24 BoogieIcfgContainer [2025-02-06 19:33:24,916 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:33:24,916 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:33:24,916 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:33:24,921 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:33:24,921 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:33:24,921 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:33:24" (1/3) ... [2025-02-06 19:33:24,924 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40f70a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:33:24, skipping insertion in model container [2025-02-06 19:33:24,924 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:33:24,925 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:33:24" (2/3) ... [2025-02-06 19:33:24,925 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40f70a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:33:24, skipping insertion in model container [2025-02-06 19:33:24,925 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:33:24,926 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:33:24" (3/3) ... [2025-02-06 19:33:24,927 INFO L363 chiAutomizerObserver]: Analyzing ICFG as2013-hybrid.i [2025-02-06 19:33:24,971 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:33:24,971 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:33:24,971 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:33:24,971 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:33:24,972 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:33:24,972 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:33:24,972 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:33:24,972 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:33:24,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 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) [2025-02-06 19:33:24,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2025-02-06 19:33:24,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:33:24,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:33:24,998 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:33:24,999 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:33:24,999 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:33:24,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 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) [2025-02-06 19:33:25,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2025-02-06 19:33:25,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:33:25,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:33:25,002 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:33:25,003 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:33:25,009 INFO L752 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;" [2025-02-06 19:33:25,010 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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;" [2025-02-06 19:33:25,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:33:25,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1728, now seen corresponding path program 1 times [2025-02-06 19:33:25,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:33:25,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011847274] [2025-02-06 19:33:25,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:33:25,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:33:25,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:33:25,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:33:25,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:25,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:33:25,094 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:33:25,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:33:25,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:33:25,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:25,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:33:25,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:33:25,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:33:25,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1599231, now seen corresponding path program 1 times [2025-02-06 19:33:25,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:33:25,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747893163] [2025-02-06 19:33:25,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:33:25,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:33:25,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:33:25,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:33:25,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:25,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:33:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:33:25,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:33:25,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747893163] [2025-02-06 19:33:25,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747893163] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:33:25,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:33:25,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 19:33:25,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095061269] [2025-02-06 19:33:25,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:33:25,222 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:33:25,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:33:25,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:33:25,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:33:25,249 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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) [2025-02-06 19:33:25,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:33:25,268 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2025-02-06 19:33:25,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2025-02-06 19:33:25,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-06 19:33:25,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 15 states and 17 transitions. [2025-02-06 19:33:25,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-02-06 19:33:25,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-02-06 19:33:25,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2025-02-06 19:33:25,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:33:25,279 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-02-06 19:33:25,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2025-02-06 19:33:25,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 11. [2025-02-06 19:33:25,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 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) [2025-02-06 19:33:25,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2025-02-06 19:33:25,304 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-02-06 19:33:25,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:33:25,310 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-02-06 19:33:25,311 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:33:25,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2025-02-06 19:33:25,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-02-06 19:33:25,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:33:25,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:33:25,312 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:33:25,312 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:33:25,313 INFO L752 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;" [2025-02-06 19:33:25,313 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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 main_~i~0#1 > 9;main_~i~0#1 := 0;" "havoc main_~j~0#1;" [2025-02-06 19:33:25,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:33:25,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1728, now seen corresponding path program 2 times [2025-02-06 19:33:25,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:33:25,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615886577] [2025-02-06 19:33:25,314 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:33:25,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:33:25,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:33:25,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:33:25,327 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:33:25,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:33:25,327 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:33:25,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:33:25,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:33:25,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:25,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:33:25,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:33:25,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:33:25,336 INFO L85 PathProgramCache]: Analyzing trace with hash -743176671, now seen corresponding path program 1 times [2025-02-06 19:33:25,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:33:25,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781138385] [2025-02-06 19:33:25,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:33:25,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:33:25,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:33:25,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:33:25,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:25,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:33:25,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:33:25,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:33:25,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781138385] [2025-02-06 19:33:25,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781138385] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:33:25,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683589249] [2025-02-06 19:33:25,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:33:25,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:33:25,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:25,379 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:33:25,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 19:33:25,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:33:25,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:33:25,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:25,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:33:25,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 19:33:25,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:33:25,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:33:25,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:33:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:33:25,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683589249] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:33:25,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:33:25,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-06 19:33:25,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356421264] [2025-02-06 19:33:25,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:33:25,512 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:33:25,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:33:25,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 19:33:25,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 19:33:25,513 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 3 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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) [2025-02-06 19:33:25,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:33:25,560 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2025-02-06 19:33:25,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2025-02-06 19:33:25,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2025-02-06 19:33:25,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 28 transitions. [2025-02-06 19:33:25,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-02-06 19:33:25,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-02-06 19:33:25,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2025-02-06 19:33:25,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:33:25,562 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-02-06 19:33:25,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2025-02-06 19:33:25,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-02-06 19:33:25,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 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) [2025-02-06 19:33:25,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-02-06 19:33:25,568 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-02-06 19:33:25,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 19:33:25,569 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-02-06 19:33:25,570 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 19:33:25,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2025-02-06 19:33:25,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2025-02-06 19:33:25,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:33:25,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:33:25,573 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:33:25,573 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 1, 1, 1, 1] [2025-02-06 19:33:25,573 INFO L752 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;" [2025-02-06 19:33:25,573 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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 main_~i~0#1 > 9;main_~i~0#1 := 0;" "havoc main_~j~0#1;" [2025-02-06 19:33:25,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:33:25,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1728, now seen corresponding path program 3 times [2025-02-06 19:33:25,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:33:25,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286234164] [2025-02-06 19:33:25,574 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:33:25,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:33:25,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:33:25,582 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:33:25,582 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:33:25,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:33:25,582 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:33:25,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:33:25,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:33:25,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:25,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:33:25,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:33:25,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:33:25,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1710956927, now seen corresponding path program 2 times [2025-02-06 19:33:25,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:33:25,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481626624] [2025-02-06 19:33:25,591 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:33:25,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:33:25,603 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-06 19:33:25,624 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 19:33:25,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:33:25,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:33:25,794 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:33:25,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:33:25,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481626624] [2025-02-06 19:33:25,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481626624] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:33:25,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212554992] [2025-02-06 19:33:25,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:33:25,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:33:25,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:25,798 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:33:25,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 19:33:25,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-06 19:33:25,856 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 19:33:25,856 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:33:25,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:33:25,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:33:25,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:33:25,907 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:33:25,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:33:26,046 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:33:26,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212554992] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:33:26,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:33:26,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-06 19:33:26,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243252931] [2025-02-06 19:33:26,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:33:26,047 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:33:26,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:33:26,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 19:33:26,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-02-06 19:33:26,048 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 3 Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 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) [2025-02-06 19:33:26,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:33:26,108 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2025-02-06 19:33:26,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 58 transitions. [2025-02-06 19:33:26,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 54 [2025-02-06 19:33:26,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 56 states and 58 transitions. [2025-02-06 19:33:26,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2025-02-06 19:33:26,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2025-02-06 19:33:26,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 58 transitions. [2025-02-06 19:33:26,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:33:26,111 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 58 transitions. [2025-02-06 19:33:26,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 58 transitions. [2025-02-06 19:33:26,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-02-06 19:33:26,114 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) [2025-02-06 19:33:26,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2025-02-06 19:33:26,115 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 58 transitions. [2025-02-06 19:33:26,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 19:33:26,116 INFO L432 stractBuchiCegarLoop]: Abstraction has 56 states and 58 transitions. [2025-02-06 19:33:26,116 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 19:33:26,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 58 transitions. [2025-02-06 19:33:26,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 54 [2025-02-06 19:33:26,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:33:26,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:33:26,118 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:33:26,118 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 10, 10, 10, 1, 1, 1, 1] [2025-02-06 19:33:26,119 INFO L752 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;" [2025-02-06 19:33:26,119 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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;" [2025-02-06 19:33:26,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:33:26,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1728, now seen corresponding path program 4 times [2025-02-06 19:33:26,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:33:26,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991676002] [2025-02-06 19:33:26,120 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:33:26,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:33:26,124 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-02-06 19:33:26,126 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:33:26,126 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:33:26,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:33:26,126 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:33:26,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:33:26,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:33:26,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:26,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:33:26,130 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:33:26,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:33:26,131 INFO L85 PathProgramCache]: Analyzing trace with hash 694780223, now seen corresponding path program 3 times [2025-02-06 19:33:26,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:33:26,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410001356] [2025-02-06 19:33:26,132 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:33:26,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:33:26,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 11 equivalence classes. [2025-02-06 19:33:26,175 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 19:33:26,175 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-06 19:33:26,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:33:26,176 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:33:26,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 19:33:26,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 19:33:26,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:26,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:33:26,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:33:26,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:33:26,206 INFO L85 PathProgramCache]: Analyzing trace with hash -111893826, now seen corresponding path program 1 times [2025-02-06 19:33:26,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:33:26,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126079882] [2025-02-06 19:33:26,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:33:26,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:33:26,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 19:33:26,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 19:33:26,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:26,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:33:26,351 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-06 19:33:26,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:33:26,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126079882] [2025-02-06 19:33:26,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126079882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:33:26,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:33:26,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 19:33:26,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121919366] [2025-02-06 19:33:26,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:33:27,301 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:33:27,302 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:33:27,302 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:33:27,303 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:33:27,303 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:33:27,303 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:27,303 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:33:27,303 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:33:27,303 INFO L132 ssoRankerPreferences]: Filename of dumped script: as2013-hybrid.i_Iteration4_Loop [2025-02-06 19:33:27,303 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:33:27,304 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:33:27,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:27,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:27,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:27,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:27,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:27,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:27,365 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:33:27,366 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:33:27,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:27,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:27,370 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:27,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-06 19:33:27,373 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:33:27,373 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:33:27,397 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:33:27,397 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 19:33:27,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-06 19:33:27,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:27,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:27,410 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:27,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-06 19:33:27,414 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:33:27,414 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:33:27,432 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:33:27,432 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: [] [2025-02-06 19:33:27,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-02-06 19:33:27,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:27,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:27,443 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:27,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-06 19:33:27,446 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:33:27,446 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:33:27,460 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:33:27,460 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: [] [2025-02-06 19:33:27,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-06 19:33:27,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:27,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:27,471 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:27,473 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:33:27,474 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:33:27,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-06 19:33:27,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-06 19:33:27,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:27,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:27,497 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:27,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-06 19:33:27,506 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:33:27,506 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:33:27,525 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:33:27,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-06 19:33:27,533 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:33:27,533 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:33:27,533 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:33:27,533 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:33:27,533 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:33:27,533 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:27,533 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:33:27,533 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:33:27,533 INFO L132 ssoRankerPreferences]: Filename of dumped script: as2013-hybrid.i_Iteration4_Loop [2025-02-06 19:33:27,533 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:33:27,534 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:33:27,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:27,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:27,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:27,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:27,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:27,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:27,587 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:33:27,591 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:33:27,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:27,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:27,594 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:27,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-06 19:33:27,599 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 [2025-02-06 19:33:27,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:33:27,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:33:27,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:33:27,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:33:27,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:33:27,620 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:33:27,620 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:33:27,622 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:33:27,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-06 19:33:27,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:27,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:27,633 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:27,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-06 19:33:27,636 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 [2025-02-06 19:33:27,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:33:27,649 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:33:27,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:33:27,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:33:27,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:33:27,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:33:27,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:33:27,652 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:33:27,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-06 19:33:27,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:27,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:27,663 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:27,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-06 19:33:27,665 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 [2025-02-06 19:33:27,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:33:27,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:33:27,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:33:27,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:33:27,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:33:27,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:33:27,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:33:27,681 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:33:27,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-02-06 19:33:27,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:27,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:27,691 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:27,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-06 19:33:27,693 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 [2025-02-06 19:33:27,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:33:27,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:33:27,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:33:27,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:33:27,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:33:27,705 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:33:27,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:33:27,707 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:33:27,709 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-02-06 19:33:27,711 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-06 19:33:27,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:27,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:27,714 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:27,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-06 19:33:27,716 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:33:27,717 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:33:27,717 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:33:27,717 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 [] [2025-02-06 19:33:27,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-06 19:33:27,725 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:33:27,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:33:27,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:33:27,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:33:27,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:27,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:33:27,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:33:27,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:33:27,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 19:33:27,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 19:33:27,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:27,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:33:27,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 19:33:27,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:33:27,917 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-06 19:33:27,921 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 [2025-02-06 19:33:27,922 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) [2025-02-06 19:33:27,971 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. [2025-02-06 19:33:27,972 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 [2025-02-06 19:33:27,973 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) [2025-02-06 19:33:27,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2025-02-06 19:33:27,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 54 letters. [2025-02-06 19:33:27,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:33:27,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 56 letters. Loop has 54 letters. [2025-02-06 19:33:27,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:33:27,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 108 letters. [2025-02-06 19:33:27,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:33:27,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 175 transitions. [2025-02-06 19:33:27,994 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2025-02-06 19:33:27,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 167 states and 173 transitions. [2025-02-06 19:33:28,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2025-02-06 19:33:28,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2025-02-06 19:33:28,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 173 transitions. [2025-02-06 19:33:28,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:33:28,003 INFO L218 hiAutomatonCegarLoop]: Abstraction has 167 states and 173 transitions. [2025-02-06 19:33:28,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 173 transitions. [2025-02-06 19:33:28,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2025-02-06 19:33:28,011 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) [2025-02-06 19:33:28,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 170 transitions. [2025-02-06 19:33:28,013 INFO L240 hiAutomatonCegarLoop]: Abstraction has 164 states and 170 transitions. [2025-02-06 19:33:28,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:33:28,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:33:28,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:33:28,014 INFO L87 Difference]: Start difference. First operand 164 states and 170 transitions. 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) [2025-02-06 19:33:28,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:33:28,033 INFO L93 Difference]: Finished difference Result 217 states and 222 transitions. [2025-02-06 19:33:28,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 217 states and 222 transitions. [2025-02-06 19:33:28,036 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 115 [2025-02-06 19:33:28,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 217 states to 165 states and 169 transitions. [2025-02-06 19:33:28,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 165 [2025-02-06 19:33:28,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 165 [2025-02-06 19:33:28,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 165 states and 169 transitions. [2025-02-06 19:33:28,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:33:28,040 INFO L218 hiAutomatonCegarLoop]: Abstraction has 165 states and 169 transitions. [2025-02-06 19:33:28,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states and 169 transitions. [2025-02-06 19:33:28,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 110. [2025-02-06 19:33:28,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 110 states have (on average 1.0272727272727273) internal successors, (113), 109 states have internal predecessors, (113), 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) [2025-02-06 19:33:28,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2025-02-06 19:33:28,046 INFO L240 hiAutomatonCegarLoop]: Abstraction has 110 states and 113 transitions. [2025-02-06 19:33:28,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:33:28,047 INFO L432 stractBuchiCegarLoop]: Abstraction has 110 states and 113 transitions. [2025-02-06 19:33:28,047 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 19:33:28,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 113 transitions. [2025-02-06 19:33:28,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 108 [2025-02-06 19:33:28,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:33:28,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:33:28,049 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:33:28,050 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 20, 20, 20, 20, 2, 2, 2, 1, 1] [2025-02-06 19:33:28,050 INFO L752 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;" [2025-02-06 19:33:28,050 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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 true;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;" [2025-02-06 19:33:28,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:33:28,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1728, now seen corresponding path program 5 times [2025-02-06 19:33:28,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:33:28,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385801797] [2025-02-06 19:33:28,052 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:33:28,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:33:28,058 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:33:28,060 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:33:28,061 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:33:28,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:33:28,061 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:33:28,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:33:28,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:33:28,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:28,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:33:28,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:33:28,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:33:28,068 INFO L85 PathProgramCache]: Analyzing trace with hash 212548316, now seen corresponding path program 1 times [2025-02-06 19:33:28,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:33:28,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505173165] [2025-02-06 19:33:28,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:33:28,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:33:28,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 19:33:28,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 19:33:28,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:28,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:33:28,119 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:33:28,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 19:33:28,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 19:33:28,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:28,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:33:28,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:33:28,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:33:28,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1042933531, now seen corresponding path program 1 times [2025-02-06 19:33:28,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:33:28,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582286815] [2025-02-06 19:33:28,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:33:28,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:33:28,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 19:33:28,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 19:33:28,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:28,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:33:28,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-02-06 19:33:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 1 proven. 523 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2025-02-06 19:33:28,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:33:28,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582286815] [2025-02-06 19:33:28,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582286815] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:33:28,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646242410] [2025-02-06 19:33:28,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:33:28,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:33:28,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:28,421 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:33:28,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 19:33:28,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 19:33:28,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 19:33:28,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:28,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:33:28,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:33:28,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:33:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 1 proven. 523 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2025-02-06 19:33:28,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:33:28,892 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 1 proven. 523 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2025-02-06 19:33:28,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646242410] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:33:28,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:33:28,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-06 19:33:28,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667818216] [2025-02-06 19:33:28,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:33:30,958 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:33:30,959 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:33:30,959 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:33:30,959 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:33:30,959 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:33:30,959 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:30,959 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:33:30,959 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:33:30,959 INFO L132 ssoRankerPreferences]: Filename of dumped script: as2013-hybrid.i_Iteration5_Loop [2025-02-06 19:33:30,959 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:33:30,959 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:33:30,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:30,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:30,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:30,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:30,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:30,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:30,999 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:33:31,000 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:33:31,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:31,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:31,002 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:31,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-06 19:33:31,005 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:33:31,005 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:33:31,022 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:33:31,022 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0#1=0} Honda state: {ULTIMATE.start_main_~j~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 19:33:31,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-02-06 19:33:31,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:31,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:31,033 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:31,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-06 19:33:31,036 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:33:31,036 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:33:31,049 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:33:31,050 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: [] [2025-02-06 19:33:31,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-06 19:33:31,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:31,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:31,060 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:31,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-06 19:33:31,064 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:33:31,064 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:33:31,082 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:33:31,082 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 19:33:31,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-02-06 19:33:31,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:31,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:31,093 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:31,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-06 19:33:31,096 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:33:31,096 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:33:31,110 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:33:31,110 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: [] [2025-02-06 19:33:31,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-02-06 19:33:31,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:31,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:31,122 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:31,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-06 19:33:31,125 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:33:31,125 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:33:31,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-02-06 19:33:31,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:31,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:31,152 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:31,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-06 19:33:31,155 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:33:31,155 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:33:31,170 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:33:31,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-06 19:33:31,178 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:33:31,178 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:33:31,178 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:33:31,178 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:33:31,178 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:33:31,178 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:31,178 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:33:31,178 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:33:31,178 INFO L132 ssoRankerPreferences]: Filename of dumped script: as2013-hybrid.i_Iteration5_Loop [2025-02-06 19:33:31,178 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:33:31,179 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:33:31,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:31,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:31,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:31,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:31,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:31,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:31,218 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:33:31,219 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:33:31,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:31,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:31,221 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:31,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-06 19:33:31,222 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 [2025-02-06 19:33:31,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:33:31,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:33:31,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:33:31,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:33:31,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:33:31,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:33:31,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:33:31,236 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:33:31,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-06 19:33:31,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:31,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:31,247 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:31,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-06 19:33:31,250 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 [2025-02-06 19:33:31,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:33:31,263 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:33:31,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:33:31,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:33:31,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:33:31,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:33:31,264 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:33:31,266 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:33:31,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-02-06 19:33:31,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:31,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:31,276 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:31,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-06 19:33:31,279 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 [2025-02-06 19:33:31,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:33:31,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:33:31,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:33:31,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:33:31,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:33:31,291 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:33:31,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:33:31,293 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:33:31,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-06 19:33:31,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:31,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:31,300 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:31,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-06 19:33:31,302 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 [2025-02-06 19:33:31,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:33:31,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:33:31,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:33:31,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:33:31,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:33:31,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:33:31,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:33:31,313 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:33:31,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-06 19:33:31,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:31,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:31,321 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:31,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-06 19:33:31,323 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 [2025-02-06 19:33:31,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:33:31,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:33:31,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:33:31,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:33:31,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:33:31,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:33:31,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:33:31,336 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:33:31,339 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 19:33:31,339 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-06 19:33:31,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:31,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:31,341 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:31,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-06 19:33:31,343 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:33:31,343 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:33:31,343 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:33:31,343 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 [] [2025-02-06 19:33:31,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-02-06 19:33:31,349 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:33:31,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:33:31,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:33:31,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:33:31,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:31,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:33:31,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:33:31,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:33:31,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 19:33:31,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 19:33:31,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:31,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:33:31,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:33:31,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:33:31,612 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 1 proven. 523 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2025-02-06 19:33:31,613 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-02-06 19:33:31,613 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 110 states and 113 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2025-02-06 19:33:31,649 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 110 states and 113 transitions. cyclomatic complexity: 4. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 331 states and 340 transitions. Complement of second has 9 states. [2025-02-06 19:33:31,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-02-06 19:33:31,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2025-02-06 19:33:31,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2025-02-06 19:33:31,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 108 letters. [2025-02-06 19:33:31,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:33:31,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 110 letters. Loop has 108 letters. [2025-02-06 19:33:31,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:33:31,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 216 letters. [2025-02-06 19:33:31,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:33:31,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331 states and 340 transitions. [2025-02-06 19:33:31,655 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 118 [2025-02-06 19:33:31,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331 states to 329 states and 338 transitions. [2025-02-06 19:33:31,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 219 [2025-02-06 19:33:31,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 221 [2025-02-06 19:33:31,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 329 states and 338 transitions. [2025-02-06 19:33:31,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:33:31,657 INFO L218 hiAutomatonCegarLoop]: Abstraction has 329 states and 338 transitions. [2025-02-06 19:33:31,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states and 338 transitions. [2025-02-06 19:33:31,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 272. [2025-02-06 19:33:31,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 272 states have (on average 1.0294117647058822) internal successors, (280), 271 states have internal predecessors, (280), 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) [2025-02-06 19:33:31,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 280 transitions. [2025-02-06 19:33:31,665 INFO L240 hiAutomatonCegarLoop]: Abstraction has 272 states and 280 transitions. [2025-02-06 19:33:31,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:33:31,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 19:33:31,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-06 19:33:31,666 INFO L87 Difference]: Start difference. First operand 272 states and 280 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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) [2025-02-06 19:33:31,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:33:31,701 INFO L93 Difference]: Finished difference Result 539 states and 550 transitions. [2025-02-06 19:33:31,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 539 states and 550 transitions. [2025-02-06 19:33:31,705 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 334 [2025-02-06 19:33:31,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 539 states to 433 states and 442 transitions. [2025-02-06 19:33:31,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 433 [2025-02-06 19:33:31,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 433 [2025-02-06 19:33:31,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 433 states and 442 transitions. [2025-02-06 19:33:31,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:33:31,709 INFO L218 hiAutomatonCegarLoop]: Abstraction has 433 states and 442 transitions. [2025-02-06 19:33:31,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states and 442 transitions. [2025-02-06 19:33:31,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 326. [2025-02-06 19:33:31,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 326 states have (on average 1.021472392638037) internal successors, (333), 325 states have internal predecessors, (333), 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) [2025-02-06 19:33:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 333 transitions. [2025-02-06 19:33:31,721 INFO L240 hiAutomatonCegarLoop]: Abstraction has 326 states and 333 transitions. [2025-02-06 19:33:31,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 19:33:31,723 INFO L432 stractBuchiCegarLoop]: Abstraction has 326 states and 333 transitions. [2025-02-06 19:33:31,723 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-06 19:33:31,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 326 states and 333 transitions. [2025-02-06 19:33:31,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 324 [2025-02-06 19:33:31,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:33:31,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:33:31,728 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:33:31,728 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [60, 60, 60, 60, 60, 6, 6, 6, 5, 1] [2025-02-06 19:33:31,728 INFO L752 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;" [2025-02-06 19:33:31,728 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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 true;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 true;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 true;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 true;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 true;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;" [2025-02-06 19:33:31,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:33:31,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1728, now seen corresponding path program 6 times [2025-02-06 19:33:31,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:33:31,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911373916] [2025-02-06 19:33:31,730 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:33:31,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:33:31,734 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:33:31,735 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:33:31,735 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 19:33:31,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:33:31,735 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:33:31,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:33:31,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:33:31,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:31,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:33:31,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:33:31,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:33:31,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1117950928, now seen corresponding path program 2 times [2025-02-06 19:33:31,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:33:31,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123317673] [2025-02-06 19:33:31,739 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:33:31,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:33:31,764 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 324 statements into 2 equivalence classes. [2025-02-06 19:33:31,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 324 of 324 statements. [2025-02-06 19:33:31,802 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:33:31,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:33:31,802 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:33:31,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-02-06 19:33:31,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-02-06 19:33:31,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:31,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:33:31,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:33:31,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:33:31,870 INFO L85 PathProgramCache]: Analyzing trace with hash -571225329, now seen corresponding path program 2 times [2025-02-06 19:33:31,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:33:31,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164213666] [2025-02-06 19:33:31,871 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:33:31,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:33:31,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 326 statements into 2 equivalence classes. [2025-02-06 19:33:31,923 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 326 of 326 statements. [2025-02-06 19:33:31,923 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:33:31,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:33:32,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-06 19:33:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 9270 backedges. 5 proven. 7855 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2025-02-06 19:33:32,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:33:32,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164213666] [2025-02-06 19:33:32,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164213666] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:33:32,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632085897] [2025-02-06 19:33:32,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:33:32,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:33:32,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:32,528 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:33:32,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-02-06 19:33:32,637 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 326 statements into 2 equivalence classes. [2025-02-06 19:33:32,744 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 326 of 326 statements. [2025-02-06 19:33:32,744 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:33:32,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:33:32,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:33:32,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:33:33,212 INFO L134 CoverageAnalysis]: Checked inductivity of 9270 backedges. 5 proven. 7855 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2025-02-06 19:33:33,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:33:33,696 INFO L134 CoverageAnalysis]: Checked inductivity of 9270 backedges. 5 proven. 7855 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2025-02-06 19:33:33,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632085897] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:33:33,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:33:33,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-02-06 19:33:33,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052292028] [2025-02-06 19:33:33,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:33:44,252 WARN L286 SmtUtils]: Spent 10.50s on a formula simplification. DAG size of input: 1034 DAG size of output: 725 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-02-06 19:33:47,624 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:33:47,624 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:33:47,624 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:33:47,624 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:33:47,624 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:33:47,624 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:47,624 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:33:47,624 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:33:47,624 INFO L132 ssoRankerPreferences]: Filename of dumped script: as2013-hybrid.i_Iteration6_Loop [2025-02-06 19:33:47,624 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:33:47,624 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:33:47,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:47,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:47,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:47,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:47,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:47,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:47,660 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:33:47,660 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:33:47,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:47,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:47,662 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:47,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-06 19:33:47,665 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:33:47,665 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:33:47,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-06 19:33:47,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:47,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:47,684 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:47,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-02-06 19:33:47,686 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:33:47,686 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:33:47,698 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:33:47,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-02-06 19:33:47,704 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:33:47,704 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:33:47,704 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:33:47,704 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:33:47,704 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:33:47,704 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:47,704 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:33:47,704 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:33:47,704 INFO L132 ssoRankerPreferences]: Filename of dumped script: as2013-hybrid.i_Iteration6_Loop [2025-02-06 19:33:47,704 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:33:47,704 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:33:47,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:47,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:47,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:47,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:47,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:47,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:33:47,741 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:33:47,741 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:33:47,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:47,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:47,743 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:47,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-02-06 19:33:47,747 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 [2025-02-06 19:33:47,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:33:47,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:33:47,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:33:47,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:33:47,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:33:47,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:33:47,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:33:47,761 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:33:47,764 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 19:33:47,764 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-06 19:33:47,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:33:47,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:33:47,768 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:33:47,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-02-06 19:33:47,770 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:33:47,770 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:33:47,770 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:33:47,770 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 [] [2025-02-06 19:33:47,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-02-06 19:33:47,780 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:33:47,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:33:47,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:33:47,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:33:47,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:47,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:33:47,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:33:47,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:33:47,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-02-06 19:33:47,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-02-06 19:33:47,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:47,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:33:47,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 19:33:47,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:33:48,456 INFO L134 CoverageAnalysis]: Checked inductivity of 9270 backedges. 5 proven. 7855 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2025-02-06 19:33:48,457 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2025-02-06 19:33:48,457 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 326 states and 333 transitions. cyclomatic complexity: 8 Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:33:48,567 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 326 states and 333 transitions. cyclomatic complexity: 8. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 979 states and 1000 transitions. Complement of second has 17 states. [2025-02-06 19:33:48,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2025-02-06 19:33:48,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:33:48,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2025-02-06 19:33:48,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 59 transitions. Stem has 2 letters. Loop has 324 letters. [2025-02-06 19:33:48,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:33:48,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 59 transitions. Stem has 326 letters. Loop has 324 letters. [2025-02-06 19:33:48,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:33:48,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 59 transitions. Stem has 2 letters. Loop has 648 letters. [2025-02-06 19:33:48,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:33:48,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 979 states and 1000 transitions. [2025-02-06 19:33:48,583 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 354 [2025-02-06 19:33:48,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 979 states to 977 states and 998 transitions. [2025-02-06 19:33:48,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 651 [2025-02-06 19:33:48,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 653 [2025-02-06 19:33:48,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 977 states and 998 transitions. [2025-02-06 19:33:48,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:33:48,589 INFO L218 hiAutomatonCegarLoop]: Abstraction has 977 states and 998 transitions. [2025-02-06 19:33:48,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states and 998 transitions. [2025-02-06 19:33:48,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 704. [2025-02-06 19:33:48,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 704 states have (on average 1.0227272727272727) internal successors, (720), 703 states have internal predecessors, (720), 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) [2025-02-06 19:33:48,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 720 transitions. [2025-02-06 19:33:48,621 INFO L240 hiAutomatonCegarLoop]: Abstraction has 704 states and 720 transitions. [2025-02-06 19:33:48,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:33:48,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 19:33:48,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 19:33:48,622 INFO L87 Difference]: Start difference. First operand 704 states and 720 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 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) [2025-02-06 19:33:48,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:33:48,692 INFO L93 Difference]: Finished difference Result 1187 states and 1210 transitions. [2025-02-06 19:33:48,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1187 states and 1210 transitions. [2025-02-06 19:33:48,699 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 570 [2025-02-06 19:33:48,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1187 states to 865 states and 882 transitions. [2025-02-06 19:33:48,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 865 [2025-02-06 19:33:48,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 865 [2025-02-06 19:33:48,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 865 states and 882 transitions. [2025-02-06 19:33:48,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:33:48,710 INFO L218 hiAutomatonCegarLoop]: Abstraction has 865 states and 882 transitions. [2025-02-06 19:33:48,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states and 882 transitions. [2025-02-06 19:33:48,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 542. [2025-02-06 19:33:48,721 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) [2025-02-06 19:33:48,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 553 transitions. [2025-02-06 19:33:48,723 INFO L240 hiAutomatonCegarLoop]: Abstraction has 542 states and 553 transitions. [2025-02-06 19:33:48,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 19:33:48,724 INFO L432 stractBuchiCegarLoop]: Abstraction has 542 states and 553 transitions. [2025-02-06 19:33:48,724 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-06 19:33:48,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 542 states and 553 transitions. [2025-02-06 19:33:48,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 540 [2025-02-06 19:33:48,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:33:48,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:33:48,731 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:33:48,731 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [100, 100, 100, 100, 100, 10, 10, 10, 9, 1] [2025-02-06 19:33:48,731 INFO L752 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;" [2025-02-06 19:33:48,731 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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 true;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 true;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 true;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 true;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 true;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 true;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 true;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 true;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 true;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;" [2025-02-06 19:33:48,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:33:48,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1728, now seen corresponding path program 7 times [2025-02-06 19:33:48,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:33:48,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797181018] [2025-02-06 19:33:48,733 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:33:48,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:33:48,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:33:48,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:33:48,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:48,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:33:48,737 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:33:48,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:33:48,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:33:48,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:48,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:33:48,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:33:48,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:33:48,741 INFO L85 PathProgramCache]: Analyzing trace with hash -688492348, now seen corresponding path program 3 times [2025-02-06 19:33:48,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:33:48,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137511598] [2025-02-06 19:33:48,742 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:33:48,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:33:48,784 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 540 statements into 76 equivalence classes. [2025-02-06 19:33:48,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) and asserted 540 of 540 statements. [2025-02-06 19:33:48,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2025-02-06 19:33:48,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:33:48,891 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:33:48,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes. [2025-02-06 19:33:48,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements. [2025-02-06 19:33:48,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:48,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:33:48,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:33:48,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:33:48,976 INFO L85 PathProgramCache]: Analyzing trace with hash -899599613, now seen corresponding path program 3 times [2025-02-06 19:33:48,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:33:48,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822092391] [2025-02-06 19:33:48,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:33:48,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:33:49,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 542 statements into 76 equivalence classes. [2025-02-06 19:33:49,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) and asserted 542 of 542 statements. [2025-02-06 19:33:49,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2025-02-06 19:33:49,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:33:49,103 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:33:49,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-02-06 19:33:49,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-02-06 19:33:49,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:33:49,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:33:49,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:33:50,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-02-06 19:34:18,245 WARN L286 SmtUtils]: Spent 28.95s on a formula simplification. DAG size of input: 1718 DAG size of output: 1203 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-02-06 19:34:27,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:34:27,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:34:27,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:34:27,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:34:27,846 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:34:27,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:34:27,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:34:27,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:34:27,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:34:27,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.02 07:34:27 BoogieIcfgContainer [2025-02-06 19:34:27,979 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-06 19:34:27,979 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 19:34:27,979 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 19:34:27,979 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 19:34:27,981 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:33:24" (3/4) ... [2025-02-06 19:34:27,982 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-02-06 19:34:28,082 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 19:34:28,082 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 19:34:28,083 INFO L158 Benchmark]: Toolchain (without parser) took 63573.08ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 111.3MB in the beginning and 561.1MB in the end (delta: -449.9MB). Peak memory consumption was 558.0MB. Max. memory is 16.1GB. [2025-02-06 19:34:28,084 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 209.7MB. Free memory is still 131.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:34:28,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.13ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 101.3MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:34:28,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.39ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 99.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:34:28,084 INFO L158 Benchmark]: Boogie Preprocessor took 17.31ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 99.1MB in the end (delta: 797.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:34:28,085 INFO L158 Benchmark]: IcfgBuilder took 185.05ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 88.5MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:34:28,086 INFO L158 Benchmark]: BuchiAutomizer took 63062.47ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 88.5MB in the beginning and 573.7MB in the end (delta: -485.3MB). Peak memory consumption was 516.0MB. Max. memory is 16.1GB. [2025-02-06 19:34:28,086 INFO L158 Benchmark]: Witness Printer took 103.34ms. Allocated memory is still 1.1GB. Free memory was 573.7MB in the beginning and 561.1MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 19:34:28,088 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.18ms. Allocated memory is still 209.7MB. Free memory is still 131.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.13ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 101.3MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.39ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 99.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.31ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 99.1MB in the end (delta: 797.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 185.05ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 88.5MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 63062.47ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 88.5MB in the beginning and 573.7MB in the end (delta: -485.3MB). Peak memory consumption was 516.0MB. Max. memory is 16.1GB. * Witness Printer took 103.34ms. Allocated memory is still 1.1GB. Free memory was 573.7MB in the beginning and 561.1MB in the end (delta: 12.6MB). 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 9 terminating modules (6 trivial, 3 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 5 locations. One deterministic module has affine ranking function i and consists of 9 locations. 6 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 62.8s and 7 iterations. TraceHistogramMax:100. Analysis of lassos took 60.9s. Construction of modules took 0.2s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 822 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2121/10499 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 229 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 226 mSDsluCounter, 317 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 233 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 211 IncrementalHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 84 mSDtfsCounter, 211 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc0 concLT3 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: unsat Degree: 0 Time: 30ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s 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! [2025-02-06 19:34:28,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-02-06 19:34:28,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-06 19:34:28,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 19:34:28,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 19:34:28,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with 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)