./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-lit/hh2012-ex1b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 48c9605d 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/hh2012-ex1b.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 7ce79fe11836d82ec064e02fff135ad9866417774e7d276b3384b4d4dde863b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:40:05,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:40:05,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-08 14:40:05,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:40:05,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:40:05,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:40:05,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:40:05,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:40:05,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:40:05,533 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:40:05,534 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:40:05,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:40:05,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:40:05,535 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:40:05,535 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:40:05,535 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:40:05,536 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:40:05,536 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:40:05,536 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:40:05,536 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:40:05,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:40:05,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:40:05,536 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:40:05,536 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:40:05,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:40:05,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:40:05,536 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:40:05,537 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:40:05,537 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:40:05,537 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:40:05,537 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:40:05,537 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:40:05,537 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:40:05,537 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:40:05,537 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:40:05,538 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:40:05,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:40:05,538 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:40:05,538 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:40:05,539 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:40:05,539 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 -> 7ce79fe11836d82ec064e02fff135ad9866417774e7d276b3384b4d4dde863b5 [2025-02-08 14:40:05,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:40:05,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:40:05,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:40:05,786 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:40:05,787 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:40:05,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/hh2012-ex1b.i [2025-02-08 14:40:06,893 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/330af88a1/c6c2b6489fa64c1f86e3cdd0bd6a414f/FLAG18389bb0b [2025-02-08 14:40:07,093 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:40:07,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex1b.i [2025-02-08 14:40:07,099 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/330af88a1/c6c2b6489fa64c1f86e3cdd0bd6a414f/FLAG18389bb0b [2025-02-08 14:40:07,464 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/330af88a1/c6c2b6489fa64c1f86e3cdd0bd6a414f [2025-02-08 14:40:07,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:40:07,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:40:07,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:40:07,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:40:07,471 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:40:07,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:40:07" (1/1) ... [2025-02-08 14:40:07,472 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@340f9b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:07, skipping insertion in model container [2025-02-08 14:40:07,472 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:40:07" (1/1) ... [2025-02-08 14:40:07,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:40:07,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:40:07,591 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:40:07,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:40:07,611 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:40:07,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:07 WrapperNode [2025-02-08 14:40:07,612 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:40:07,613 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:40:07,613 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:40:07,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:40:07,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:07" (1/1) ... [2025-02-08 14:40:07,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:07" (1/1) ... [2025-02-08 14:40:07,635 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 53 [2025-02-08 14:40:07,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:40:07,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:40:07,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:40:07,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:40:07,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:07" (1/1) ... [2025-02-08 14:40:07,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:07" (1/1) ... [2025-02-08 14:40:07,644 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:07" (1/1) ... [2025-02-08 14:40:07,650 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-08 14:40:07,650 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:07" (1/1) ... [2025-02-08 14:40:07,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:07" (1/1) ... [2025-02-08 14:40:07,653 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:07" (1/1) ... [2025-02-08 14:40:07,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:07" (1/1) ... [2025-02-08 14:40:07,654 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:07" (1/1) ... [2025-02-08 14:40:07,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:07" (1/1) ... [2025-02-08 14:40:07,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:40:07,656 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:40:07,656 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:40:07,656 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:40:07,657 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:07" (1/1) ... [2025-02-08 14:40:07,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:07,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:07,687 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-08 14:40:07,693 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-08 14:40:07,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:40:07,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:40:07,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:40:07,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:40:07,757 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:40:07,759 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:40:07,847 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-08 14:40:07,847 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:40:07,854 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:40:07,855 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:40:07,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:40:07 BoogieIcfgContainer [2025-02-08 14:40:07,856 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:40:07,856 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:40:07,856 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:40:07,860 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:40:07,860 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:40:07,860 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:40:07" (1/3) ... [2025-02-08 14:40:07,861 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@434fc5c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:40:07, skipping insertion in model container [2025-02-08 14:40:07,861 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:40:07,861 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:07" (2/3) ... [2025-02-08 14:40:07,861 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@434fc5c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:40:07, skipping insertion in model container [2025-02-08 14:40:07,861 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:40:07,861 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:40:07" (3/3) ... [2025-02-08 14:40:07,862 INFO L363 chiAutomizerObserver]: Analyzing ICFG hh2012-ex1b.i [2025-02-08 14:40:07,898 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:40:07,898 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:40:07,898 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:40:07,899 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:40:07,899 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:40:07,899 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:40:07,899 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:40:07,899 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:40:07,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 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-08 14:40:07,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2025-02-08 14:40:07,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:07,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:07,916 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:40:07,917 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:40:07,917 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:40:07,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 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-08 14:40:07,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2025-02-08 14:40:07,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:07,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:07,920 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:40:07,920 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:40:07,925 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(10, 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-08 14:40:07,925 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100;main_~j~0#1 := 0;" "assume !(main_~j~0#1 < 100);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 100 == main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_~j~0#1;" [2025-02-08 14:40:07,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:07,932 INFO L85 PathProgramCache]: Analyzing trace with hash 59, now seen corresponding path program 1 times [2025-02-08 14:40:07,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:07,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970418946] [2025-02-08 14:40:07,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:40:07,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:07,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:07,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:07,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:07,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:07,994 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:07,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:07,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:07,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:08,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:08,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:08,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:08,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1678586767, now seen corresponding path program 1 times [2025-02-08 14:40:08,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:08,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624210476] [2025-02-08 14:40:08,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:40:08,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:08,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:40:08,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:40:08,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:08,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:08,099 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-08 14:40:08,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:40:08,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624210476] [2025-02-08 14:40:08,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624210476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:40:08,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:40:08,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:40:08,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719976474] [2025-02-08 14:40:08,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:40:08,103 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:40:08,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:40:08,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:40:08,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:40:08,122 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 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 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:40:08,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:40:08,146 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2025-02-08 14:40:08,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 19 transitions. [2025-02-08 14:40:08,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-02-08 14:40:08,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 10 states and 11 transitions. [2025-02-08 14:40:08,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-08 14:40:08,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-08 14:40:08,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2025-02-08 14:40:08,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:40:08,152 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-02-08 14:40:08,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2025-02-08 14:40:08,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-02-08 14:40:08,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 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-08 14:40:08,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2025-02-08 14:40:08,167 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-02-08 14:40:08,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:40:08,173 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-02-08 14:40:08,175 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:40:08,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2025-02-08 14:40:08,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-02-08 14:40:08,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:08,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:08,176 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:40:08,176 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:40:08,176 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(10, 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-08 14:40:08,177 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100;main_~j~0#1 := 0;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume !(main_~j~0#1 < 100);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 100 == main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_~j~0#1;" [2025-02-08 14:40:08,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:08,178 INFO L85 PathProgramCache]: Analyzing trace with hash 59, now seen corresponding path program 2 times [2025-02-08 14:40:08,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:08,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632410482] [2025-02-08 14:40:08,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:40:08,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:08,182 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:08,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:08,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:40:08,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:08,184 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:08,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:08,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:08,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:08,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:08,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:08,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:08,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1913686574, now seen corresponding path program 1 times [2025-02-08 14:40:08,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:08,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742494890] [2025-02-08 14:40:08,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:40:08,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:08,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:40:08,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:40:08,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:08,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:08,245 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-08 14:40:08,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:40:08,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742494890] [2025-02-08 14:40:08,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742494890] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:40:08,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88676214] [2025-02-08 14:40:08,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:40:08,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:40:08,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:08,252 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-08 14:40:08,254 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-08 14:40:08,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:40:08,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:40:08,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:08,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:08,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 14:40:08,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:08,327 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-08 14:40:08,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:40:08,351 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-08 14:40:08,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88676214] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:40:08,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:40:08,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-08 14:40:08,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157261485] [2025-02-08 14:40:08,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:40:08,352 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:40:08,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:40:08,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:40:08,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:40:08,353 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:40:08,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:40:08,372 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2025-02-08 14:40:08,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2025-02-08 14:40:08,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2025-02-08 14:40:08,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2025-02-08 14:40:08,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-02-08 14:40:08,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-02-08 14:40:08,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2025-02-08 14:40:08,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:40:08,373 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 20 transitions. [2025-02-08 14:40:08,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2025-02-08 14:40:08,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-02-08 14:40:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 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-08 14:40:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2025-02-08 14:40:08,375 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 20 transitions. [2025-02-08 14:40:08,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:40:08,376 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2025-02-08 14:40:08,376 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:40:08,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2025-02-08 14:40:08,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2025-02-08 14:40:08,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:08,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:08,377 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:40:08,377 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-08 14:40:08,377 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(10, 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-08 14:40:08,377 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100;main_~j~0#1 := 0;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume !(main_~j~0#1 < 100);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 100 == main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_~j~0#1;" [2025-02-08 14:40:08,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:08,378 INFO L85 PathProgramCache]: Analyzing trace with hash 59, now seen corresponding path program 3 times [2025-02-08 14:40:08,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:08,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106483377] [2025-02-08 14:40:08,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:40:08,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:08,381 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:08,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:08,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:40:08,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:08,385 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:08,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:08,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:08,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:08,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:08,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:08,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:08,389 INFO L85 PathProgramCache]: Analyzing trace with hash 103942863, now seen corresponding path program 2 times [2025-02-08 14:40:08,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:08,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332555424] [2025-02-08 14:40:08,389 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:40:08,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:08,397 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-08 14:40:08,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:40:08,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:40:08,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:08,515 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:08,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:40:08,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332555424] [2025-02-08 14:40:08,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332555424] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:40:08,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786713577] [2025-02-08 14:40:08,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:40:08,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:40:08,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:08,520 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-08 14:40:08,521 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-08 14:40:08,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-08 14:40:08,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:40:08,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:40:08,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:08,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:40:08,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:08,582 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:08,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:40:08,670 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:08,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786713577] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:40:08,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:40:08,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-08 14:40:08,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678652690] [2025-02-08 14:40:08,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:40:08,671 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:40:08,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:40:08,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 14:40:08,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:40:08,672 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 2 Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 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-08 14:40:08,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:40:08,696 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2025-02-08 14:40:08,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 38 transitions. [2025-02-08 14:40:08,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2025-02-08 14:40:08,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 38 transitions. [2025-02-08 14:40:08,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-02-08 14:40:08,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-02-08 14:40:08,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 38 transitions. [2025-02-08 14:40:08,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:40:08,697 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 38 transitions. [2025-02-08 14:40:08,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 38 transitions. [2025-02-08 14:40:08,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-08 14:40:08,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.027027027027027) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:40:08,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2025-02-08 14:40:08,700 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 38 transitions. [2025-02-08 14:40:08,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 14:40:08,701 INFO L432 stractBuchiCegarLoop]: Abstraction has 37 states and 38 transitions. [2025-02-08 14:40:08,701 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-08 14:40:08,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 38 transitions. [2025-02-08 14:40:08,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2025-02-08 14:40:08,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:08,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:08,702 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:40:08,702 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-02-08 14:40:08,702 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(10, 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-08 14:40:08,702 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100;main_~j~0#1 := 0;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume !(main_~j~0#1 < 100);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 100 == main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_~j~0#1;" [2025-02-08 14:40:08,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:08,705 INFO L85 PathProgramCache]: Analyzing trace with hash 59, now seen corresponding path program 4 times [2025-02-08 14:40:08,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:08,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756991865] [2025-02-08 14:40:08,705 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:40:08,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:08,707 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-02-08 14:40:08,711 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:08,712 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:40:08,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:08,712 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:08,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:08,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:08,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:08,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:08,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:08,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:08,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1730565713, now seen corresponding path program 3 times [2025-02-08 14:40:08,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:08,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044039422] [2025-02-08 14:40:08,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:40:08,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:08,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 11 equivalence classes. [2025-02-08 14:40:08,750 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 14:40:08,751 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-08 14:40:08,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:08,975 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:08,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:40:08,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044039422] [2025-02-08 14:40:08,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044039422] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:40:08,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083844929] [2025-02-08 14:40:08,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:40:08,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:40:08,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:08,978 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:40:08,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 14:40:09,005 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 11 equivalence classes. [2025-02-08 14:40:09,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 14:40:09,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-08 14:40:09,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:09,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 14:40:09,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:09,075 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:09,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:40:09,305 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:09,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083844929] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:40:09,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:40:09,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-02-08 14:40:09,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603299858] [2025-02-08 14:40:09,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:40:09,306 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:40:09,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:40:09,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 14:40:09,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-02-08 14:40:09,307 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. cyclomatic complexity: 2 Second operand has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 23 states have internal predecessors, (68), 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-08 14:40:09,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:40:09,358 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2025-02-08 14:40:09,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 74 transitions. [2025-02-08 14:40:09,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 72 [2025-02-08 14:40:09,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 73 states and 74 transitions. [2025-02-08 14:40:09,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2025-02-08 14:40:09,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2025-02-08 14:40:09,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 74 transitions. [2025-02-08 14:40:09,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:40:09,361 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73 states and 74 transitions. [2025-02-08 14:40:09,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 74 transitions. [2025-02-08 14:40:09,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-02-08 14:40:09,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.0136986301369864) internal successors, (74), 72 states have internal predecessors, (74), 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-08 14:40:09,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2025-02-08 14:40:09,367 INFO L240 hiAutomatonCegarLoop]: Abstraction has 73 states and 74 transitions. [2025-02-08 14:40:09,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 14:40:09,371 INFO L432 stractBuchiCegarLoop]: Abstraction has 73 states and 74 transitions. [2025-02-08 14:40:09,371 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-08 14:40:09,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 74 transitions. [2025-02-08 14:40:09,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 72 [2025-02-08 14:40:09,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:09,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:09,372 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:40:09,372 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [22, 22, 22, 1, 1, 1, 1, 1, 1] [2025-02-08 14:40:09,372 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(10, 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-08 14:40:09,372 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100;main_~j~0#1 := 0;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume !(main_~j~0#1 < 100);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 100 == main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_~j~0#1;" [2025-02-08 14:40:09,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:09,374 INFO L85 PathProgramCache]: Analyzing trace with hash 59, now seen corresponding path program 5 times [2025-02-08 14:40:09,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:09,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313964160] [2025-02-08 14:40:09,375 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:40:09,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:09,377 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:09,378 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:09,378 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:40:09,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:09,378 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:09,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:09,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:09,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:09,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:09,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:09,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:09,380 INFO L85 PathProgramCache]: Analyzing trace with hash -541786257, now seen corresponding path program 4 times [2025-02-08 14:40:09,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:09,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968209508] [2025-02-08 14:40:09,380 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:40:09,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:09,389 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 72 statements into 2 equivalence classes. [2025-02-08 14:40:09,427 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 14:40:09,427 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:40:09,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:09,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:40:09,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968209508] [2025-02-08 14:40:09,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968209508] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:40:09,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846596826] [2025-02-08 14:40:09,910 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:40:09,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:40:09,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:09,916 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:40:09,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 14:40:09,955 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 72 statements into 2 equivalence classes. [2025-02-08 14:40:09,975 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 14:40:09,976 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:40:09,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:09,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 14:40:09,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:10,091 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:10,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:40:10,775 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:10,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846596826] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:40:10,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:40:10,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-02-08 14:40:10,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117540381] [2025-02-08 14:40:10,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:40:10,777 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:40:10,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:40:10,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-08 14:40:10,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-02-08 14:40:10,779 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. cyclomatic complexity: 2 Second operand has 48 states, 48 states have (on average 2.9166666666666665) internal successors, (140), 47 states have internal predecessors, (140), 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-08 14:40:10,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:40:10,858 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2025-02-08 14:40:10,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 146 transitions. [2025-02-08 14:40:10,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 144 [2025-02-08 14:40:10,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 145 states and 146 transitions. [2025-02-08 14:40:10,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2025-02-08 14:40:10,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 [2025-02-08 14:40:10,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 146 transitions. [2025-02-08 14:40:10,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:40:10,863 INFO L218 hiAutomatonCegarLoop]: Abstraction has 145 states and 146 transitions. [2025-02-08 14:40:10,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 146 transitions. [2025-02-08 14:40:10,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-02-08 14:40:10,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 145 states have (on average 1.006896551724138) internal successors, (146), 144 states have internal predecessors, (146), 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-08 14:40:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2025-02-08 14:40:10,872 INFO L240 hiAutomatonCegarLoop]: Abstraction has 145 states and 146 transitions. [2025-02-08 14:40:10,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-08 14:40:10,873 INFO L432 stractBuchiCegarLoop]: Abstraction has 145 states and 146 transitions. [2025-02-08 14:40:10,873 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-08 14:40:10,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 145 states and 146 transitions. [2025-02-08 14:40:10,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 144 [2025-02-08 14:40:10,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:10,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:10,875 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:40:10,875 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [46, 46, 46, 1, 1, 1, 1, 1, 1] [2025-02-08 14:40:10,875 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(10, 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-08 14:40:10,875 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100;main_~j~0#1 := 0;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume !(main_~j~0#1 < 100);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 100 == main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_~j~0#1;" [2025-02-08 14:40:10,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:10,876 INFO L85 PathProgramCache]: Analyzing trace with hash 59, now seen corresponding path program 6 times [2025-02-08 14:40:10,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:10,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868510243] [2025-02-08 14:40:10,876 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:40:10,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:10,881 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:10,882 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:10,882 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 14:40:10,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:10,882 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:10,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:10,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:10,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:10,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:10,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:10,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:10,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1398535441, now seen corresponding path program 5 times [2025-02-08 14:40:10,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:10,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476137022] [2025-02-08 14:40:10,885 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:40:10,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:10,905 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 144 statements into 47 equivalence classes. [2025-02-08 14:40:10,998 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 144 of 144 statements. [2025-02-08 14:40:10,998 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-02-08 14:40:10,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:12,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:40:12,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476137022] [2025-02-08 14:40:12,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476137022] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:40:12,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436145187] [2025-02-08 14:40:12,450 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:40:12,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:40:12,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:12,453 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:40:12,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 14:40:12,499 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 144 statements into 47 equivalence classes. [2025-02-08 14:40:12,578 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 144 of 144 statements. [2025-02-08 14:40:12,578 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-02-08 14:40:12,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:12,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-08 14:40:12,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:12,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:12,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:40:14,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:14,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436145187] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:40:14,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:40:14,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-02-08 14:40:14,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397701359] [2025-02-08 14:40:14,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:40:14,839 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:40:14,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:40:14,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-02-08 14:40:14,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-02-08 14:40:14,842 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. cyclomatic complexity: 2 Second operand has 96 states, 96 states have (on average 2.9583333333333335) internal successors, (284), 95 states have internal predecessors, (284), 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-08 14:40:15,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:40:15,002 INFO L93 Difference]: Finished difference Result 289 states and 290 transitions. [2025-02-08 14:40:15,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 289 states and 290 transitions. [2025-02-08 14:40:15,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 288 [2025-02-08 14:40:15,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 289 states to 289 states and 290 transitions. [2025-02-08 14:40:15,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 289 [2025-02-08 14:40:15,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 289 [2025-02-08 14:40:15,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 289 states and 290 transitions. [2025-02-08 14:40:15,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:40:15,009 INFO L218 hiAutomatonCegarLoop]: Abstraction has 289 states and 290 transitions. [2025-02-08 14:40:15,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states and 290 transitions. [2025-02-08 14:40:15,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2025-02-08 14:40:15,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 289 states have (on average 1.0034602076124568) internal successors, (290), 288 states have internal predecessors, (290), 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-08 14:40:15,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2025-02-08 14:40:15,016 INFO L240 hiAutomatonCegarLoop]: Abstraction has 289 states and 290 transitions. [2025-02-08 14:40:15,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-02-08 14:40:15,020 INFO L432 stractBuchiCegarLoop]: Abstraction has 289 states and 290 transitions. [2025-02-08 14:40:15,020 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-08 14:40:15,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 289 states and 290 transitions. [2025-02-08 14:40:15,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 288 [2025-02-08 14:40:15,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:15,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:15,026 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:40:15,026 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [94, 94, 94, 1, 1, 1, 1, 1, 1] [2025-02-08 14:40:15,026 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(10, 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-08 14:40:15,027 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100;main_~j~0#1 := 0;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume !(main_~j~0#1 < 100);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 100 == main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_~j~0#1;" [2025-02-08 14:40:15,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:15,028 INFO L85 PathProgramCache]: Analyzing trace with hash 59, now seen corresponding path program 7 times [2025-02-08 14:40:15,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:15,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201823476] [2025-02-08 14:40:15,028 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 14:40:15,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:15,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:15,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:15,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:15,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:15,032 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:15,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:15,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:15,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:15,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:15,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:15,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:15,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1872994799, now seen corresponding path program 6 times [2025-02-08 14:40:15,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:15,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935458874] [2025-02-08 14:40:15,034 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:40:15,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:15,053 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 288 statements into 95 equivalence classes. [2025-02-08 14:40:15,206 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 288 of 288 statements. [2025-02-08 14:40:15,206 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-02-08 14:40:15,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:19,385 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:19,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:40:19,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935458874] [2025-02-08 14:40:19,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935458874] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:40:19,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109311763] [2025-02-08 14:40:19,385 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:40:19,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:40:19,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:19,387 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:40:19,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 14:40:19,469 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 288 statements into 95 equivalence classes. [2025-02-08 14:40:19,641 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 288 of 288 statements. [2025-02-08 14:40:19,642 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-02-08 14:40:19,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:19,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-02-08 14:40:19,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:19,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:40:23,047 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:23,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109311763] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:40:23,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:40:23,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 101 [2025-02-08 14:40:23,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701964320] [2025-02-08 14:40:23,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:40:23,048 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:40:23,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:40:23,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2025-02-08 14:40:23,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2025-02-08 14:40:23,050 INFO L87 Difference]: Start difference. First operand 289 states and 290 transitions. cyclomatic complexity: 2 Second operand has 102 states, 102 states have (on average 2.9901960784313726) internal successors, (305), 101 states have internal predecessors, (305), 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-08 14:40:23,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:40:23,191 INFO L93 Difference]: Finished difference Result 307 states and 308 transitions. [2025-02-08 14:40:23,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 308 transitions. [2025-02-08 14:40:23,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 306 [2025-02-08 14:40:23,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 307 states and 308 transitions. [2025-02-08 14:40:23,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 307 [2025-02-08 14:40:23,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 307 [2025-02-08 14:40:23,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 307 states and 308 transitions. [2025-02-08 14:40:23,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:40:23,197 INFO L218 hiAutomatonCegarLoop]: Abstraction has 307 states and 308 transitions. [2025-02-08 14:40:23,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states and 308 transitions. [2025-02-08 14:40:23,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2025-02-08 14:40:23,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 307 states have (on average 1.003257328990228) internal successors, (308), 306 states have internal predecessors, (308), 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-08 14:40:23,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 308 transitions. [2025-02-08 14:40:23,205 INFO L240 hiAutomatonCegarLoop]: Abstraction has 307 states and 308 transitions. [2025-02-08 14:40:23,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2025-02-08 14:40:23,205 INFO L432 stractBuchiCegarLoop]: Abstraction has 307 states and 308 transitions. [2025-02-08 14:40:23,205 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-08 14:40:23,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 307 states and 308 transitions. [2025-02-08 14:40:23,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 306 [2025-02-08 14:40:23,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:23,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:23,208 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:40:23,208 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [100, 100, 100, 1, 1, 1, 1, 1, 1] [2025-02-08 14:40:23,209 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(10, 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-08 14:40:23,209 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100;main_~j~0#1 := 0;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume !(main_~j~0#1 < 100);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 100 == main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_~j~0#1;" [2025-02-08 14:40:23,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:23,214 INFO L85 PathProgramCache]: Analyzing trace with hash 59, now seen corresponding path program 8 times [2025-02-08 14:40:23,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:23,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403167002] [2025-02-08 14:40:23,214 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:40:23,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:23,216 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:23,218 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:23,218 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:40:23,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:23,218 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:23,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:23,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:23,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:23,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:23,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:23,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:23,223 INFO L85 PathProgramCache]: Analyzing trace with hash 486521039, now seen corresponding path program 7 times [2025-02-08 14:40:23,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:23,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364423382] [2025-02-08 14:40:23,223 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 14:40:23,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:23,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-08 14:40:23,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-08 14:40:23,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:23,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:23,302 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:23,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-08 14:40:23,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-08 14:40:23,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:23,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:23,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:23,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:23,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1000786295, now seen corresponding path program 1 times [2025-02-08 14:40:23,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:23,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737240259] [2025-02-08 14:40:23,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:40:23,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:23,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-08 14:40:23,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-08 14:40:23,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:23,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:23,420 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:23,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-08 14:40:23,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-08 14:40:23,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:23,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:23,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:33,261 WARN L286 SmtUtils]: Spent 9.74s on a formula simplification. DAG size of input: 1228 DAG size of output: 923 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-02-08 14:40:46,568 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:40:46,569 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:40:46,569 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:40:46,569 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:40:46,569 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:40:46,569 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:46,569 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:40:46,569 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:40:46,569 INFO L132 ssoRankerPreferences]: Filename of dumped script: hh2012-ex1b.i_Iteration8_Loop [2025-02-08 14:40:46,569 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:40:46,570 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:40:46,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:46,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:46,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:46,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:46,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:46,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:46,623 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:40:46,624 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:40:46,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:46,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:46,627 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-08 14:40:46,629 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-08 14:40:46,632 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:40:46,632 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:40:46,645 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:40:46,645 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-08 14:40:46,651 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-08 14:40:46,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:46,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:46,653 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-08 14:40:46,654 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-08 14:40:46,655 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:40:46,655 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:40:46,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-08 14:40:46,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:46,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:46,673 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-08 14:40:46,673 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-08 14:40:46,674 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:40:46,674 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:40:46,696 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:40:46,699 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-08 14:40:46,700 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:40:46,700 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:40:46,700 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:40:46,700 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:40:46,700 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:40:46,700 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:46,700 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:40:46,700 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:40:46,700 INFO L132 ssoRankerPreferences]: Filename of dumped script: hh2012-ex1b.i_Iteration8_Loop [2025-02-08 14:40:46,700 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:40:46,700 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:40:46,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:46,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:46,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:46,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:46,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:46,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:46,739 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:40:46,741 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:40:46,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:46,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:46,744 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-08 14:40:46,745 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-08 14:40:46,746 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-08 14:40:46,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:40:46,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:40:46,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:40:46,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:40:46,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:40:46,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:40:46,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:40:46,764 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:40:46,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-02-08 14:40:46,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:46,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:46,771 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-08 14:40:46,773 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-08 14:40:46,775 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-08 14:40:46,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:40:46,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:40:46,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:40:46,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:40:46,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:40:46,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:40:46,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:40:46,789 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:40:46,793 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:40:46,797 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:40:46,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:46,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:46,800 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-08 14:40:46,802 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-08 14:40:46,803 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:40:46,803 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:40:46,803 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:40:46,804 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 199 Supporting invariants [] [2025-02-08 14:40:46,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-02-08 14:40:46,814 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:40:46,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:46,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:46,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:46,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:46,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:46,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:40:46,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:46,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-08 14:40:46,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-08 14:40:46,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:46,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:46,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:40:46,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:47,901 INFO L134 CoverageAnalysis]: Checked inductivity of 14950 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14950 trivial. 0 not checked. [2025-02-08 14:40:47,907 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-08 14:40:47,908 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 307 states and 308 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:40:47,944 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 307 states and 308 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 614 states and 617 transitions. Complement of second has 6 states. [2025-02-08 14:40:47,946 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-08 14:40:47,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:40:47,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2025-02-08 14:40:47,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 306 letters. [2025-02-08 14:40:47,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:40:47,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 307 letters. Loop has 306 letters. [2025-02-08 14:40:47,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:40:47,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 612 letters. [2025-02-08 14:40:47,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:40:47,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 614 states and 617 transitions. [2025-02-08 14:40:47,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-08 14:40:47,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 614 states to 612 states and 615 transitions. [2025-02-08 14:40:47,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 304 [2025-02-08 14:40:47,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2025-02-08 14:40:47,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 612 states and 615 transitions. [2025-02-08 14:40:47,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:40:47,967 INFO L218 hiAutomatonCegarLoop]: Abstraction has 612 states and 615 transitions. [2025-02-08 14:40:47,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states and 615 transitions. [2025-02-08 14:40:47,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 313. [2025-02-08 14:40:47,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 313 states have (on average 1.0095846645367412) internal successors, (316), 312 states have internal predecessors, (316), 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-08 14:40:47,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 316 transitions. [2025-02-08 14:40:47,975 INFO L240 hiAutomatonCegarLoop]: Abstraction has 313 states and 316 transitions. [2025-02-08 14:40:47,975 INFO L432 stractBuchiCegarLoop]: Abstraction has 313 states and 316 transitions. [2025-02-08 14:40:47,975 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-08 14:40:47,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 313 states and 316 transitions. [2025-02-08 14:40:47,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-08 14:40:47,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:47,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:47,984 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-08 14:40:47,984 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:40:47,984 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(10, 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;" "assume main_~i~0#1 < 100;main_~j~0#1 := 0;" [2025-02-08 14:40:47,984 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" [2025-02-08 14:40:47,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:47,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1856, now seen corresponding path program 1 times [2025-02-08 14:40:47,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:47,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405980760] [2025-02-08 14:40:47,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:40:47,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:47,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:40:47,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:40:47,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:47,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:47,988 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:47,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:40:47,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:40:47,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:47,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:47,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:47,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:47,991 INFO L85 PathProgramCache]: Analyzing trace with hash 55572, now seen corresponding path program 1 times [2025-02-08 14:40:47,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:47,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297668196] [2025-02-08 14:40:47,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:40:47,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:47,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:40:47,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:40:47,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:47,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:47,997 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:47,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:40:47,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:40:47,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:47,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:48,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:48,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:48,001 INFO L85 PathProgramCache]: Analyzing trace with hash 55317877, now seen corresponding path program 1 times [2025-02-08 14:40:48,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:48,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191271087] [2025-02-08 14:40:48,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:40:48,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:48,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:40:48,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:40:48,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:48,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:48,006 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:48,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:40:48,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:40:48,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:48,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:48,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:48,028 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:40:48,028 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:40:48,028 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:40:48,028 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:40:48,028 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:40:48,028 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:48,028 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:40:48,028 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:40:48,028 INFO L132 ssoRankerPreferences]: Filename of dumped script: hh2012-ex1b.i_Iteration9_Loop [2025-02-08 14:40:48,028 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:40:48,029 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:40:48,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:48,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:48,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:48,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:48,055 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:40:48,056 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:40:48,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:48,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:48,058 INFO L229 MonitoredProcess]: Starting monitored process 14 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-08 14:40:48,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-08 14:40:48,061 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:40:48,061 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:40:48,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-02-08 14:40:48,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:48,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:48,079 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-08 14:40:48,080 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-08 14:40:48,082 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:40:48,082 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:40:48,200 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:40:48,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-02-08 14:40:48,207 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:40:48,207 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:40:48,207 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:40:48,207 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:40:48,207 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:40:48,207 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:48,207 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:40:48,207 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:40:48,207 INFO L132 ssoRankerPreferences]: Filename of dumped script: hh2012-ex1b.i_Iteration9_Loop [2025-02-08 14:40:48,207 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:40:48,207 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:40:48,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:48,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:48,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:48,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:48,235 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:40:48,235 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:40:48,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:48,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:48,237 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-08 14:40:48,238 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-08 14:40:48,239 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-08 14:40:48,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:40:48,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:40:48,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:40:48,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:40:48,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:40:48,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:40:48,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:40:48,252 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:40:48,254 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:40:48,254 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:40:48,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:48,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:48,256 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-08 14:40:48,258 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-08 14:40:48,259 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:40:48,259 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:40:48,259 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:40:48,259 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 199 Supporting invariants [] [2025-02-08 14:40:48,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-02-08 14:40:48,265 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:40:48,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:48,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:40:48,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:40:48,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:48,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:48,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:40:48,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:48,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:40:48,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:40:48,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:48,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:48,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:40:48,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:48,302 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-08 14:40:48,302 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-08 14:40:48,303 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 313 states and 316 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-08 14:40:48,316 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 313 states and 316 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 820 states and 824 transitions. Complement of second has 5 states. [2025-02-08 14:40:48,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-08 14:40:48,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-08 14:40:48,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2025-02-08 14:40:48,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 2 letters. Loop has 3 letters. [2025-02-08 14:40:48,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:40:48,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 3 letters. [2025-02-08 14:40:48,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:40:48,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 2 letters. Loop has 6 letters. [2025-02-08 14:40:48,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:40:48,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 820 states and 824 transitions. [2025-02-08 14:40:48,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-08 14:40:48,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 820 states to 616 states and 619 transitions. [2025-02-08 14:40:48,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-02-08 14:40:48,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-02-08 14:40:48,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 616 states and 619 transitions. [2025-02-08 14:40:48,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:40:48,327 INFO L218 hiAutomatonCegarLoop]: Abstraction has 616 states and 619 transitions. [2025-02-08 14:40:48,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states and 619 transitions. [2025-02-08 14:40:48,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 614. [2025-02-08 14:40:48,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 614 states have (on average 1.004885993485342) internal successors, (617), 613 states have internal predecessors, (617), 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-08 14:40:48,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 617 transitions. [2025-02-08 14:40:48,333 INFO L240 hiAutomatonCegarLoop]: Abstraction has 614 states and 617 transitions. [2025-02-08 14:40:48,333 INFO L432 stractBuchiCegarLoop]: Abstraction has 614 states and 617 transitions. [2025-02-08 14:40:48,333 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-08 14:40:48,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 614 states and 617 transitions. [2025-02-08 14:40:48,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-08 14:40:48,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:48,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:48,340 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [100, 100, 100, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:40:48,341 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:40:48,341 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(10, 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;" "assume main_~i~0#1 < 100;main_~j~0#1 := 0;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume !(main_~j~0#1 < 100);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 100 == main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_~j~0#1;" "assume main_~i~0#1 < 100;main_~j~0#1 := 0;" [2025-02-08 14:40:48,341 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < 100;main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" [2025-02-08 14:40:48,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:48,342 INFO L85 PathProgramCache]: Analyzing trace with hash -959604046, now seen corresponding path program 2 times [2025-02-08 14:40:48,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:48,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49134817] [2025-02-08 14:40:48,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:40:48,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:48,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 308 statements into 2 equivalence classes. [2025-02-08 14:40:48,412 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 308 of 308 statements. [2025-02-08 14:40:48,412 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:40:48,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:48,413 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:48,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-02-08 14:40:48,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-02-08 14:40:48,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:48,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:48,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:48,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:48,479 INFO L85 PathProgramCache]: Analyzing trace with hash 55572, now seen corresponding path program 2 times [2025-02-08 14:40:48,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:48,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153820332] [2025-02-08 14:40:48,479 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:40:48,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:48,481 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:40:48,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:40:48,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:40:48,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:48,482 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:48,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:40:48,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:40:48,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:48,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:48,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:48,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:48,484 INFO L85 PathProgramCache]: Analyzing trace with hash -261786429, now seen corresponding path program 3 times [2025-02-08 14:40:48,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:48,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993256087] [2025-02-08 14:40:48,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:40:48,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:48,500 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 311 statements into 102 equivalence classes. [2025-02-08 14:40:48,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 102 check-sat command(s) and asserted 311 of 311 statements. [2025-02-08 14:40:48,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 102 check-sat command(s) [2025-02-08 14:40:48,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:48,558 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:48,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-02-08 14:40:48,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-02-08 14:40:48,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:48,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:48,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:48,619 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:40:48,619 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:40:48,619 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:40:48,619 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:40:48,619 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:40:48,619 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:48,619 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:40:48,619 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:40:48,620 INFO L132 ssoRankerPreferences]: Filename of dumped script: hh2012-ex1b.i_Iteration10_Loop [2025-02-08 14:40:48,620 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:40:48,620 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:40:48,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:48,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:48,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:48,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:48,641 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:40:48,642 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:40:48,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:48,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:48,644 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-08 14:40:48,645 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-08 14:40:48,646 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:40:48,646 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:40:48,662 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-08 14:40:48,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:48,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:48,664 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-08 14:40:48,666 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-08 14:40:48,667 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:40:48,667 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:40:48,792 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:40:48,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-02-08 14:40:48,799 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:40:48,799 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:40:48,799 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:40:48,799 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:40:48,799 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:40:48,799 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:48,799 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:40:48,799 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:40:48,799 INFO L132 ssoRankerPreferences]: Filename of dumped script: hh2012-ex1b.i_Iteration10_Loop [2025-02-08 14:40:48,799 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:40:48,799 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:40:48,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:48,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:48,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:48,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:48,828 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:40:48,828 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:40:48,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:48,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:48,830 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-08 14:40:48,832 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-08 14:40:48,833 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-08 14:40:48,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:40:48,843 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:40:48,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:40:48,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:40:48,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:40:48,844 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:40:48,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:40:48,846 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:40:48,849 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:40:48,849 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:40:48,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:48,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:48,852 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-08 14:40:48,854 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-08 14:40:48,855 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:40:48,855 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:40:48,855 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:40:48,855 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 199 Supporting invariants [] [2025-02-08 14:40:48,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-02-08 14:40:48,861 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:40:48,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:48,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-02-08 14:40:48,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-02-08 14:40:48,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:48,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:48,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:40:48,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:49,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:40:49,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:40:49,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:49,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:49,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:40:49,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:49,309 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-08 14:40:49,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-02-08 14:40:49,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-02-08 14:40:49,326 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-08 14:40:49,327 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-08 14:40:49,327 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 614 states and 617 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:40:49,338 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 614 states and 617 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 814 states and 818 transitions. Complement of second has 5 states. [2025-02-08 14:40:49,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-08 14:40:49,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:40:49,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2025-02-08 14:40:49,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 308 letters. Loop has 3 letters. [2025-02-08 14:40:49,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:40:49,339 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:40:49,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:49,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-02-08 14:40:49,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-02-08 14:40:49,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:49,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:49,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:40:49,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:49,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:40:49,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:40:49,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:49,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:49,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:40:49,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:49,747 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-08 14:40:49,748 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-08 14:40:49,748 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 614 states and 617 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:40:49,762 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 614 states and 617 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 814 states and 818 transitions. Complement of second has 5 states. [2025-02-08 14:40:49,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-08 14:40:49,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:40:49,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-02-08 14:40:49,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 308 letters. Loop has 3 letters. [2025-02-08 14:40:49,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:40:49,763 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:40:49,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:49,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-02-08 14:40:49,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-02-08 14:40:49,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:49,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:49,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:40:49,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:50,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:40:50,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:40:50,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:50,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:50,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:40:50,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:50,178 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-08 14:40:50,178 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-08 14:40:50,179 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 614 states and 617 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:40:50,191 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 614 states and 617 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1017 states and 1021 transitions. Complement of second has 4 states. [2025-02-08 14:40:50,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-08 14:40:50,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:40:50,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2025-02-08 14:40:50,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 308 letters. Loop has 3 letters. [2025-02-08 14:40:50,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:40:50,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 311 letters. Loop has 3 letters. [2025-02-08 14:40:50,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:40:50,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 308 letters. Loop has 6 letters. [2025-02-08 14:40:50,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:40:50,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1017 states and 1021 transitions. [2025-02-08 14:40:50,198 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:40:50,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1017 states to 0 states and 0 transitions. [2025-02-08 14:40:50,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-08 14:40:50,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-08 14:40:50,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-08 14:40:50,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:40:50,199 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:40:50,199 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:40:50,199 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:40:50,199 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-08 14:40:50,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-08 14:40:50,199 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:40:50,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-08 14:40:50,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:40:50 BoogieIcfgContainer [2025-02-08 14:40:50,205 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:40:50,205 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:40:50,205 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:40:50,206 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:40:50,206 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:40:07" (3/4) ... [2025-02-08 14:40:50,208 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 14:40:50,208 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:40:50,209 INFO L158 Benchmark]: Toolchain (without parser) took 42741.77ms. Allocated memory was 142.6MB in the beginning and 864.0MB in the end (delta: 721.4MB). Free memory was 112.6MB in the beginning and 684.5MB in the end (delta: -572.0MB). Peak memory consumption was 148.6MB. Max. memory is 16.1GB. [2025-02-08 14:40:50,209 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:40:50,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 144.80ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 101.7MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:40:50,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.74ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.7MB in the end (delta: 986.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:40:50,209 INFO L158 Benchmark]: Boogie Preprocessor took 18.84ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:40:50,210 INFO L158 Benchmark]: IcfgBuilder took 199.80ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 88.4MB in the end (delta: 11.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 14:40:50,210 INFO L158 Benchmark]: BuchiAutomizer took 42348.84ms. Allocated memory was 142.6MB in the beginning and 864.0MB in the end (delta: 721.4MB). Free memory was 88.4MB in the beginning and 684.7MB in the end (delta: -596.3MB). Peak memory consumption was 123.4MB. Max. memory is 16.1GB. [2025-02-08 14:40:50,210 INFO L158 Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 864.0MB. Free memory was 684.7MB in the beginning and 684.5MB in the end (delta: 177.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:40:50,211 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.19ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 144.80ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 101.7MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.74ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.7MB in the end (delta: 986.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.84ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 199.80ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 88.4MB in the end (delta: 11.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 42348.84ms. Allocated memory was 142.6MB in the beginning and 864.0MB in the end (delta: 721.4MB). Free memory was 88.4MB in the beginning and 684.7MB in the end (delta: -596.3MB). Peak memory consumption was 123.4MB. Max. memory is 16.1GB. * Witness Printer took 2.81ms. Allocated memory is still 864.0MB. Free memory was 684.7MB in the beginning and 684.5MB in the end (delta: 177.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (7 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i) + 199) and consists of 4 locations. One deterministic module has affine ranking function (((long long) -2 * j) + 199) and consists of 3 locations. One nondeterministic module has affine ranking function (((long long) -2 * j) + 199) and consists of 3 locations. 7 modules have a trivial ranking function, the largest among these consists of 102 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 42.3s and 11 iterations. TraceHistogramMax:100. Analysis of lassos took 39.0s. Construction of modules took 0.2s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 3. Minimization of det autom 8. Minimization of nondet autom 2. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 301 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 14950/14950 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 209 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 204 mSDsluCounter, 760 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 657 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 385 IncrementalHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 103 mSDtfsCounter, 385 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI7 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-08 14:40:50,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 14:40:50,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 14:40:50,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 14:40:50,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 14:40:51,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 14:40:51,227 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-08 14:40:51,430 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 Result: TRUE