./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/NO_13.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 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/termination-restricted-15/NO_13.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash eeea679d58a502ae5881094604c1f31424fa081cb4c3d3de58dd4530f33f3571 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:02:24,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:02:24,832 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-01-10 07:02:24,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:02:24,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:02:24,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:02:24,870 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:02:24,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:02:24,871 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:02:24,871 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:02:24,872 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:02:24,872 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:02:24,872 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:02:24,872 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:02:24,872 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:02:24,872 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:02:24,873 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:02:24,873 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:02:24,873 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:02:24,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:02:24,873 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:02:24,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:02:24,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:02:24,873 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:02:24,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:02:24,873 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:02:24,874 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:02:24,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:02:24,874 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:02:24,874 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:02:24,874 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:02:24,874 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:02:24,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:02:24,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:02:24,875 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:02:24,875 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:02:24,875 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eeea679d58a502ae5881094604c1f31424fa081cb4c3d3de58dd4530f33f3571 [2025-01-10 07:02:25,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:02:25,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:02:25,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:02:25,185 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:02:25,186 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:02:25,188 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NO_13.c [2025-01-10 07:02:26,481 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f8377e37/0f683244b0bb40e6990190e3e3508765/FLAG924726e37 [2025-01-10 07:02:26,694 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:02:26,695 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_13.c [2025-01-10 07:02:26,710 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f8377e37/0f683244b0bb40e6990190e3e3508765/FLAG924726e37 [2025-01-10 07:02:26,744 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f8377e37/0f683244b0bb40e6990190e3e3508765 [2025-01-10 07:02:26,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:02:26,747 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:02:26,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:02:26,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:02:26,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:02:26,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:02:26" (1/1) ... [2025-01-10 07:02:26,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@419bdb24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:26, skipping insertion in model container [2025-01-10 07:02:26,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:02:26" (1/1) ... [2025-01-10 07:02:26,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:02:26,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:02:26,896 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:02:26,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:02:26,920 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:02:26,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:26 WrapperNode [2025-01-10 07:02:26,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:02:26,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:02:26,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:02:26,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:02:26,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:26" (1/1) ... [2025-01-10 07:02:26,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:26" (1/1) ... [2025-01-10 07:02:26,945 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 14 [2025-01-10 07:02:26,945 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:02:26,946 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:02:26,946 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:02:26,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:02:26,952 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:26" (1/1) ... [2025-01-10 07:02:26,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:26" (1/1) ... [2025-01-10 07:02:26,953 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:26" (1/1) ... [2025-01-10 07:02:26,957 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 07:02:26,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:26" (1/1) ... [2025-01-10 07:02:26,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:26" (1/1) ... [2025-01-10 07:02:26,959 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:26" (1/1) ... [2025-01-10 07:02:26,961 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:26" (1/1) ... [2025-01-10 07:02:26,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:26" (1/1) ... [2025-01-10 07:02:26,966 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:26" (1/1) ... [2025-01-10 07:02:26,966 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:26" (1/1) ... [2025-01-10 07:02:26,967 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:02:26,968 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:02:26,969 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:02:26,969 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:02:26,970 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:26" (1/1) ... [2025-01-10 07:02:26,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:26,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:27,007 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-01-10 07:02:27,014 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-01-10 07:02:27,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:02:27,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:02:27,100 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:02:27,103 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:02:27,157 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-01-10 07:02:27,158 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:02:27,167 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:02:27,168 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 07:02:27,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:02:27 BoogieIcfgContainer [2025-01-10 07:02:27,169 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:02:27,170 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:02:27,170 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:02:27,175 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:02:27,176 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:02:27,176 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:02:26" (1/3) ... [2025-01-10 07:02:27,178 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52b85670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:02:27, skipping insertion in model container [2025-01-10 07:02:27,178 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:02:27,178 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:26" (2/3) ... [2025-01-10 07:02:27,179 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52b85670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:02:27, skipping insertion in model container [2025-01-10 07:02:27,179 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:02:27,179 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:02:27" (3/3) ... [2025-01-10 07:02:27,180 INFO L363 chiAutomizerObserver]: Analyzing ICFG NO_13.c [2025-01-10 07:02:27,233 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:02:27,233 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:02:27,234 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:02:27,234 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:02:27,234 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:02:27,235 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:02:27,235 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:02:27,235 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:02:27,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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-01-10 07:02:27,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:02:27,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:27,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:27,258 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:02:27,258 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:02:27,258 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:02:27,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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-01-10 07:02:27,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:02:27,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:27,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:27,259 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:02:27,259 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:02:27,267 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" [2025-01-10 07:02:27,267 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" [2025-01-10 07:02:27,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:27,275 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:02:27,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:27,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458160988] [2025-01-10 07:02:27,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:27,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:27,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:27,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:27,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:27,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:27,337 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:27,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:27,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:27,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:27,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:27,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:27,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:27,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1156, now seen corresponding path program 1 times [2025-01-10 07:02:27,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:27,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935012814] [2025-01-10 07:02:27,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:27,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:27,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:27,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:27,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:27,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:27,368 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:27,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:27,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:27,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:27,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:27,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:27,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:27,382 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2025-01-10 07:02:27,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:27,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687632711] [2025-01-10 07:02:27,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:27,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:27,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:27,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:27,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:27,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:27,396 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:27,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:27,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:27,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:27,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:27,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:27,502 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:27,504 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:27,504 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:27,504 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:27,504 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:02:27,504 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:27,504 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:27,505 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:27,505 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration1_Loop [2025-01-10 07:02:27,505 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:27,505 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:27,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:27,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:27,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:27,645 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:27,646 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:02:27,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:27,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:27,649 INFO L229 MonitoredProcess]: Starting monitored process 2 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-01-10 07:02:27,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-01-10 07:02:27,652 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:27,652 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:27,676 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:27,676 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:02:27,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-01-10 07:02:27,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:27,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:27,685 INFO L229 MonitoredProcess]: Starting monitored process 3 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-01-10 07:02:27,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-01-10 07:02:27,687 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:27,687 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:27,707 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:27,707 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:02:27,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:27,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:27,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:27,715 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:27,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-01-10 07:02:27,717 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:27,718 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:27,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-01-10 07:02:27,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:27,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:27,741 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:27,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-01-10 07:02:27,743 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:02:27,743 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:27,773 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:02:27,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-01-10 07:02:27,778 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:27,779 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:27,779 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:27,779 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:27,779 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:02:27,779 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:27,779 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:27,779 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:27,779 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration1_Loop [2025-01-10 07:02:27,779 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:27,779 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:27,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:27,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:27,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:27,870 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:27,874 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:02:27,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:27,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:27,878 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:27,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-01-10 07:02:27,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:27,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:27,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:27,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:27,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:27,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:02:27,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:02:27,920 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:27,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-01-10 07:02:27,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:27,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:27,929 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:27,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-01-10 07:02:27,933 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-01-10 07:02:27,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:27,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:27,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:27,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:27,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:02:27,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:02:27,953 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:27,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-01-10 07:02:27,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:27,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:27,965 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-01-10 07:02:27,966 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-01-10 07:02:27,967 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-01-10 07:02:27,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:27,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:27,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:27,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:27,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:27,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:27,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:27,983 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:02:27,987 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:02:27,990 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:02:27,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:27,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:27,996 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-01-10 07:02:27,997 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-01-10 07:02:27,998 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:02:27,999 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:02:27,999 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:02:28,000 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2025-01-10 07:02:28,008 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-01-10 07:02:28,013 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:02:28,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:28,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:28,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:28,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:28,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:28,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:28,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:28,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:28,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:28,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:28,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:28,057 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:02:28,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:28,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:28,086 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-01-10 07:02:28,088 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:28,120 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12 states and 17 transitions. Complement of second has 5 states. [2025-01-10 07:02:28,121 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-01-10 07:02:28,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:28,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2025-01-10 07:02:28,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2025-01-10 07:02:28,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:28,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2025-01-10 07:02:28,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:28,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 4 letters. [2025-01-10 07:02:28,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:28,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2025-01-10 07:02:28,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:02:28,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 11 transitions. [2025-01-10 07:02:28,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-01-10 07:02:28,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-01-10 07:02:28,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2025-01-10 07:02:28,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:28,135 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-01-10 07:02:28,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2025-01-10 07:02:28,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-01-10 07:02:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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-01-10 07:02:28,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2025-01-10 07:02:28,154 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-01-10 07:02:28,155 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-01-10 07:02:28,155 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:02:28,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2025-01-10 07:02:28,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:02:28,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:28,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:28,156 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:02:28,157 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:02:28,157 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~j~0#1;" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" [2025-01-10 07:02:28,157 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" [2025-01-10 07:02:28,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:28,160 INFO L85 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2025-01-10 07:02:28,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:28,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886219157] [2025-01-10 07:02:28,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:28,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:28,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:28,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:28,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:28,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:28,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:28,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:02:28,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886219157] [2025-01-10 07:02:28,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886219157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:02:28,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:02:28,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 07:02:28,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958688022] [2025-01-10 07:02:28,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:02:28,209 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:02:28,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:28,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1156, now seen corresponding path program 2 times [2025-01-10 07:02:28,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:28,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575791752] [2025-01-10 07:02:28,210 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:28,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:28,213 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:28,215 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:28,215 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:02:28,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:28,215 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:28,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:28,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:28,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:28,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:28,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:28,256 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:28,257 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:28,257 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:28,257 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:28,257 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:02:28,257 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,257 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:28,257 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:28,257 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration2_Loop [2025-01-10 07:02:28,257 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:28,258 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:28,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:28,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:28,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:28,330 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-01-10 07:02:28,341 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:28,341 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:02:28,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:28,344 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-01-10 07:02:28,346 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-01-10 07:02:28,348 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:28,348 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:28,367 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:28,367 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:02:28,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:28,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:28,375 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-01-10 07:02:28,376 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-01-10 07:02:28,377 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:28,377 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:28,395 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-01-10 07:02:28,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:28,398 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-01-10 07:02:28,399 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-01-10 07:02:28,400 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:02:28,400 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:28,425 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:02:28,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-01-10 07:02:28,429 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:28,429 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:28,429 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:28,429 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:28,430 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:02:28,430 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,430 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:28,430 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:28,430 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration2_Loop [2025-01-10 07:02:28,430 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:28,430 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:28,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:28,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:28,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:28,493 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:28,494 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:02:28,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:28,496 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-01-10 07:02:28,499 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-01-10 07:02:28,500 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-01-10 07:02:28,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:28,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:28,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:28,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:28,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:02:28,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:02:28,518 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:28,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-01-10 07:02:28,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:28,527 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-01-10 07:02:28,528 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-01-10 07:02:28,529 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-01-10 07:02:28,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:28,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:28,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:28,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:28,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:28,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:28,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:28,544 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:02:28,548 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:02:28,548 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:02:28,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:28,551 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-01-10 07:02:28,553 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-01-10 07:02:28,554 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:02:28,554 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:02:28,554 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:02:28,554 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2025-01-10 07:02:28,560 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-01-10 07:02:28,562 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:02:28,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:28,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:28,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:28,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:28,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:28,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:28,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:28,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:28,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:28,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:28,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:28,599 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:02:28,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:28,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:28,606 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-01-10 07:02:28,607 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:28,617 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12 states and 17 transitions. Complement of second has 5 states. [2025-01-10 07:02:28,618 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-01-10 07:02:28,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:28,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-01-10 07:02:28,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2025-01-10 07:02:28,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:28,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2025-01-10 07:02:28,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:28,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2025-01-10 07:02:28,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:28,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2025-01-10 07:02:28,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:02:28,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 17 transitions. [2025-01-10 07:02:28,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-01-10 07:02:28,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-01-10 07:02:28,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2025-01-10 07:02:28,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:28,625 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-01-10 07:02:28,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2025-01-10 07:02:28,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-01-10 07:02:28,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:28,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2025-01-10 07:02:28,627 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-01-10 07:02:28,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:02:28,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:02:28,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:02:28,630 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:28,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:02:28,637 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2025-01-10 07:02:28,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 18 transitions. [2025-01-10 07:02:28,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:02:28,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 17 transitions. [2025-01-10 07:02:28,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-01-10 07:02:28,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-01-10 07:02:28,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2025-01-10 07:02:28,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:28,639 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-01-10 07:02:28,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2025-01-10 07:02:28,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-01-10 07:02:28,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:28,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2025-01-10 07:02:28,641 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-01-10 07:02:28,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:02:28,642 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-01-10 07:02:28,642 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:02:28,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2025-01-10 07:02:28,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:02:28,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:28,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:28,643 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1] [2025-01-10 07:02:28,643 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:02:28,643 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume main_~i~0#1 < main_~j~0#1;" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" [2025-01-10 07:02:28,643 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" [2025-01-10 07:02:28,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:28,644 INFO L85 PathProgramCache]: Analyzing trace with hash 147829008, now seen corresponding path program 1 times [2025-01-10 07:02:28,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:28,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999044185] [2025-01-10 07:02:28,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:28,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:28,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:02:28,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:02:28,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:28,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:28,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:02:28,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999044185] [2025-01-10 07:02:28,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999044185] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:02:28,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752981998] [2025-01-10 07:02:28,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:28,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:02:28,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:28,723 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:02:28,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 07:02:28,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:02:28,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:02:28,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:28,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:28,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 07:02:28,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:28,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:28,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:02:28,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:28,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752981998] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:02:28,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:02:28,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-10 07:02:28,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6880043] [2025-01-10 07:02:28,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:02:28,798 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:02:28,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:28,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1156, now seen corresponding path program 3 times [2025-01-10 07:02:28,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:28,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648629148] [2025-01-10 07:02:28,798 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:02:28,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:28,802 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:28,804 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:28,804 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:02:28,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:28,804 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:28,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:28,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:28,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:28,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:28,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:28,834 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:28,834 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:28,834 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:28,834 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:28,834 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:02:28,834 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,834 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:28,834 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:28,834 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration3_Loop [2025-01-10 07:02:28,834 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:28,834 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:28,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:28,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:28,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:28,894 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:28,894 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:02:28,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:28,898 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-01-10 07:02:28,900 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-01-10 07:02:28,901 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:28,901 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:28,924 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:28,924 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:02:28,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-01-10 07:02:28,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:28,935 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-01-10 07:02:28,937 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-01-10 07:02:28,938 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:28,938 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:28,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-01-10 07:02:28,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:28,965 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-01-10 07:02:28,967 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-01-10 07:02:28,969 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:02:28,969 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:28,995 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:02:28,998 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-01-10 07:02:28,999 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:28,999 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:28,999 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:28,999 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:28,999 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:02:28,999 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,999 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:28,999 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:28,999 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration3_Loop [2025-01-10 07:02:28,999 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:28,999 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:29,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,062 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:29,063 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:02:29,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,065 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-01-10 07:02:29,068 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-01-10 07:02:29,068 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-01-10 07:02:29,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:29,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:29,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:29,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:29,088 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:02:29,088 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:02:29,091 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:29,099 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-01-10 07:02:29,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,101 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-01-10 07:02:29,104 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-01-10 07:02:29,104 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-01-10 07:02:29,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:29,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:29,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:29,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:29,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:29,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:29,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:29,119 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:02:29,121 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:02:29,121 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:02:29,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,123 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:29,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-01-10 07:02:29,124 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:02:29,125 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:02:29,125 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:02:29,125 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2025-01-10 07:02:29,130 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-01-10 07:02:29,131 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:02:29,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:29,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:02:29,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:02:29,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:29,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:29,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:29,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:29,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,165 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:02:29,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:29,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:29,168 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-01-10 07:02:29,168 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-01-10 07:02:29,182 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 14 states and 20 transitions. Complement of second has 5 states. [2025-01-10 07:02:29,183 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-01-10 07:02:29,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-01-10 07:02:29,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-01-10 07:02:29,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 8 letters. Loop has 2 letters. [2025-01-10 07:02:29,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:29,184 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:29,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:29,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:02:29,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:02:29,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:29,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:29,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:29,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:29,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,220 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:02:29,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:29,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:29,224 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2025-01-10 07:02:29,225 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-01-10 07:02:29,235 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 14 states and 20 transitions. Complement of second has 5 states. [2025-01-10 07:02:29,235 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-01-10 07:02:29,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-01-10 07:02:29,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-01-10 07:02:29,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 8 letters. Loop has 2 letters. [2025-01-10 07:02:29,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:29,236 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:29,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:29,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:02:29,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:02:29,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:29,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:29,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:29,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:29,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,277 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:02:29,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:29,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:29,280 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 1 loop predicates [2025-01-10 07:02:29,280 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-01-10 07:02:29,288 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 16 states and 23 transitions. Complement of second has 4 states. [2025-01-10 07:02:29,288 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-01-10 07:02:29,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-01-10 07:02:29,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-01-10 07:02:29,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2025-01-10 07:02:29,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:29,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2025-01-10 07:02:29,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:29,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2025-01-10 07:02:29,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:29,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 23 transitions. [2025-01-10 07:02:29,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:02:29,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 19 transitions. [2025-01-10 07:02:29,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-01-10 07:02:29,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-01-10 07:02:29,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2025-01-10 07:02:29,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:29,291 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2025-01-10 07:02:29,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2025-01-10 07:02:29,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 7. [2025-01-10 07:02:29,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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-01-10 07:02:29,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2025-01-10 07:02:29,293 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 9 transitions. [2025-01-10 07:02:29,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:02:29,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:02:29,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 07:02:29,293 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:29,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:02:29,320 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2025-01-10 07:02:29,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2025-01-10 07:02:29,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:02:29,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 16 transitions. [2025-01-10 07:02:29,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-01-10 07:02:29,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-01-10 07:02:29,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2025-01-10 07:02:29,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:29,321 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-01-10 07:02:29,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2025-01-10 07:02:29,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-01-10 07:02:29,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 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-01-10 07:02:29,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2025-01-10 07:02:29,322 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-01-10 07:02:29,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:02:29,326 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-01-10 07:02:29,326 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:02:29,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2025-01-10 07:02:29,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:02:29,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:29,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:29,327 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1] [2025-01-10 07:02:29,327 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:02:29,327 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" [2025-01-10 07:02:29,327 INFO L754 eck$LassoCheckResult]: Loop: "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume main_~i~0#1 < main_~j~0#1;" [2025-01-10 07:02:29,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:29,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1575187095, now seen corresponding path program 2 times [2025-01-10 07:02:29,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:29,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245048846] [2025-01-10 07:02:29,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:29,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:29,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-10 07:02:29,342 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:02:29,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:02:29,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:29,346 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:29,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:02:29,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:02:29,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:29,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:29,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:29,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1308, now seen corresponding path program 1 times [2025-01-10 07:02:29,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:29,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028259387] [2025-01-10 07:02:29,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:29,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:29,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:29,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:29,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:29,364 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:29,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:29,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:29,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:29,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:29,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:29,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1926310450, now seen corresponding path program 2 times [2025-01-10 07:02:29,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:29,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105904169] [2025-01-10 07:02:29,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:29,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:29,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-01-10 07:02:29,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:02:29,375 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:02:29,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:29,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:02:29,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105904169] [2025-01-10 07:02:29,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105904169] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:02:29,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819747824] [2025-01-10 07:02:29,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:29,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:02:29,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,473 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:02:29,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-01-10 07:02:29,498 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-01-10 07:02:29,504 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:02:29,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:02:29,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:02:29,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:29,532 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:29,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:02:29,607 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:29,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819747824] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:02:29,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:02:29,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-01-10 07:02:29,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479046255] [2025-01-10 07:02:29,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:02:29,640 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:29,640 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:29,640 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:29,640 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:29,641 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:02:29,641 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,641 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:29,641 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:29,641 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration4_Loop [2025-01-10 07:02:29,641 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:29,641 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:29,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-01-10 07:02:29,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-01-10 07:02:29,727 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:29,727 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:02:29,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,730 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:29,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-01-10 07:02:29,733 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:29,733 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:29,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-01-10 07:02:29,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,751 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:29,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-01-10 07:02:29,753 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:02:29,753 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:29,780 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:02:29,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-01-10 07:02:29,785 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:29,785 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:29,785 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:29,785 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:29,785 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:02:29,785 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,785 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:29,785 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:29,785 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration4_Loop [2025-01-10 07:02:29,785 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:29,785 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:29,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,840 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:29,840 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:02:29,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,843 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:29,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-01-10 07:02:29,845 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-01-10 07:02:29,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:29,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:29,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:29,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:29,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:29,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:29,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:29,859 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:02:29,861 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:02:29,861 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:02:29,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,864 INFO L229 MonitoredProcess]: Starting monitored process 27 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-01-10 07:02:29,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-01-10 07:02:29,867 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:02:29,867 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:02:29,867 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:02:29,867 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 103 Supporting invariants [] [2025-01-10 07:02:29,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-01-10 07:02:29,877 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:02:29,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:29,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:02:29,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:02:29,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:29,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:29,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:29,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:29,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,931 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:02:29,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:29,953 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-01-10 07:02:29,953 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-01-10 07:02:29,959 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 13 states and 15 transitions. Complement of second has 3 states. [2025-01-10 07:02:29,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:29,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-01-10 07:02:29,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-01-10 07:02:29,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 11 letters. Loop has 2 letters. [2025-01-10 07:02:29,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:29,960 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:29,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:29,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:02:29,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:02:29,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:29,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:29,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:30,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:30,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:30,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:30,001 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:02:30,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:30,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:30,019 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-01-10 07:02:30,019 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-01-10 07:02:30,024 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 13 states and 15 transitions. Complement of second has 3 states. [2025-01-10 07:02:30,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:30,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-01-10 07:02:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-01-10 07:02:30,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 11 letters. Loop has 2 letters. [2025-01-10 07:02:30,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:30,025 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:30,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:30,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:02:30,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:02:30,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:30,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:30,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:30,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:30,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:30,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:30,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:30,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:30,060 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:02:30,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:30,075 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-01-10 07:02:30,075 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-01-10 07:02:30,082 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 17 states and 19 transitions. Complement of second has 4 states. [2025-01-10 07:02:30,083 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-01-10 07:02:30,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-01-10 07:02:30,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-01-10 07:02:30,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 2 letters. [2025-01-10 07:02:30,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:30,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 13 letters. Loop has 2 letters. [2025-01-10 07:02:30,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:30,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 4 letters. [2025-01-10 07:02:30,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:30,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2025-01-10 07:02:30,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 07:02:30,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 17 transitions. [2025-01-10 07:02:30,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-01-10 07:02:30,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-01-10 07:02:30,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2025-01-10 07:02:30,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:30,088 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-01-10 07:02:30,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2025-01-10 07:02:30,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-01-10 07:02:30,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:30,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2025-01-10 07:02:30,090 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-01-10 07:02:30,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:02:30,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 07:02:30,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-01-10 07:02:30,090 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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-01-10 07:02:30,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:02:30,133 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2025-01-10 07:02:30,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2025-01-10 07:02:30,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:02:30,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 27 states and 29 transitions. [2025-01-10 07:02:30,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-01-10 07:02:30,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-01-10 07:02:30,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2025-01-10 07:02:30,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:30,137 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-01-10 07:02:30,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2025-01-10 07:02:30,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2025-01-10 07:02:30,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:30,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-01-10 07:02:30,139 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-01-10 07:02:30,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 07:02:30,141 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-01-10 07:02:30,141 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:02:30,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2025-01-10 07:02:30,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:02:30,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:30,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:30,142 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 1, 1] [2025-01-10 07:02:30,142 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2025-01-10 07:02:30,142 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" [2025-01-10 07:02:30,142 INFO L754 eck$LassoCheckResult]: Loop: "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" [2025-01-10 07:02:30,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:30,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1885351429, now seen corresponding path program 3 times [2025-01-10 07:02:30,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:30,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476634280] [2025-01-10 07:02:30,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:02:30,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:30,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 11 equivalence classes. [2025-01-10 07:02:30,158 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 07:02:30,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 07:02:30,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:30,158 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:30,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 07:02:30,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 07:02:30,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:30,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:30,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:30,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:30,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1257273, now seen corresponding path program 1 times [2025-01-10 07:02:30,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:30,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479014691] [2025-01-10 07:02:30,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:30,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:30,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:30,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:30,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:30,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:30,179 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:30,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:30,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:30,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:30,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:30,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:30,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:30,181 INFO L85 PathProgramCache]: Analyzing trace with hash -924533955, now seen corresponding path program 3 times [2025-01-10 07:02:30,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:30,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337579157] [2025-01-10 07:02:30,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:02:30,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:30,185 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 13 equivalence classes. [2025-01-10 07:02:30,195 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 07:02:30,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-01-10 07:02:30,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:30,383 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:02:30,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:02:30,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337579157] [2025-01-10 07:02:30,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337579157] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:02:30,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639264918] [2025-01-10 07:02:30,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:02:30,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:02:30,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:30,386 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:02:30,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-01-10 07:02:30,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 13 equivalence classes. [2025-01-10 07:02:30,422 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 07:02:30,422 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-01-10 07:02:30,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:30,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 07:02:30,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:30,476 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:02:30,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:02:30,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-01-10 07:02:30,723 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:02:30,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639264918] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:02:30,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:02:30,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2025-01-10 07:02:30,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141389640] [2025-01-10 07:02:30,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:02:30,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:02:30,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 07:02:30,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-01-10 07:02:30,772 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 3 Second operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:30,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:02:30,840 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2025-01-10 07:02:30,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 65 transitions. [2025-01-10 07:02:30,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:02:30,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 51 states and 53 transitions. [2025-01-10 07:02:30,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-01-10 07:02:30,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-01-10 07:02:30,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 53 transitions. [2025-01-10 07:02:30,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:30,842 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 53 transitions. [2025-01-10 07:02:30,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 53 transitions. [2025-01-10 07:02:30,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2025-01-10 07:02:30,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.04) internal successors, (52), 49 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:30,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2025-01-10 07:02:30,845 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 52 transitions. [2025-01-10 07:02:30,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 07:02:30,846 INFO L432 stractBuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2025-01-10 07:02:30,846 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:02:30,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 52 transitions. [2025-01-10 07:02:30,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:02:30,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:30,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:30,848 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 22, 1, 1] [2025-01-10 07:02:30,848 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2025-01-10 07:02:30,848 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" [2025-01-10 07:02:30,848 INFO L754 eck$LassoCheckResult]: Loop: "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" [2025-01-10 07:02:30,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:30,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1315309025, now seen corresponding path program 4 times [2025-01-10 07:02:30,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:30,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552554982] [2025-01-10 07:02:30,849 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:02:30,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:30,858 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-01-10 07:02:30,885 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 07:02:30,885 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:02:30,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:30,886 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:30,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 07:02:30,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 07:02:30,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:30,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:30,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:30,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:30,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1257273, now seen corresponding path program 2 times [2025-01-10 07:02:30,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:30,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429732366] [2025-01-10 07:02:30,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:30,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:30,904 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 2 equivalence classes. [2025-01-10 07:02:30,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:30,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:02:30,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:30,905 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:30,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:30,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:30,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:30,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:30,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:30,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:30,908 INFO L85 PathProgramCache]: Analyzing trace with hash -29145831, now seen corresponding path program 4 times [2025-01-10 07:02:30,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:30,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897780716] [2025-01-10 07:02:30,908 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:02:30,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:30,913 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-01-10 07:02:30,923 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 07:02:30,923 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:02:30,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:31,450 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 69 proven. 506 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:02:31,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:02:31,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897780716] [2025-01-10 07:02:31,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897780716] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:02:31,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557605334] [2025-01-10 07:02:31,450 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:02:31,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:02:31,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:31,452 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:02:31,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-01-10 07:02:31,481 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-01-10 07:02:31,498 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 07:02:31,498 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:02:31,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:31,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 07:02:31,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:31,599 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 69 proven. 506 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:02:31,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:02:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 69 proven. 506 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:02:32,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557605334] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:02:32,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:02:32,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2025-01-10 07:02:32,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861635862] [2025-01-10 07:02:32,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:02:32,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:02:32,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-10 07:02:32,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-01-10 07:02:32,467 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. cyclomatic complexity: 3 Second operand has 48 states, 48 states have (on average 2.0208333333333335) internal successors, (97), 48 states have internal predecessors, (97), 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-01-10 07:02:32,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:02:32,603 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2025-01-10 07:02:32,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 125 transitions. [2025-01-10 07:02:32,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:02:32,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 99 states and 101 transitions. [2025-01-10 07:02:32,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-01-10 07:02:32,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-01-10 07:02:32,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 101 transitions. [2025-01-10 07:02:32,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:32,606 INFO L218 hiAutomatonCegarLoop]: Abstraction has 99 states and 101 transitions. [2025-01-10 07:02:32,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 101 transitions. [2025-01-10 07:02:32,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2025-01-10 07:02:32,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 97 states have internal predecessors, (100), 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-01-10 07:02:32,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2025-01-10 07:02:32,616 INFO L240 hiAutomatonCegarLoop]: Abstraction has 98 states and 100 transitions. [2025-01-10 07:02:32,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-10 07:02:32,619 INFO L432 stractBuchiCegarLoop]: Abstraction has 98 states and 100 transitions. [2025-01-10 07:02:32,619 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 07:02:32,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 100 transitions. [2025-01-10 07:02:32,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:02:32,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:32,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:32,622 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [47, 46, 1, 1] [2025-01-10 07:02:32,622 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2025-01-10 07:02:32,626 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" [2025-01-10 07:02:32,626 INFO L754 eck$LassoCheckResult]: Loop: "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" [2025-01-10 07:02:32,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:32,626 INFO L85 PathProgramCache]: Analyzing trace with hash -499828327, now seen corresponding path program 5 times [2025-01-10 07:02:32,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:32,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648375058] [2025-01-10 07:02:32,627 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:02:32,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:32,637 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 95 statements into 47 equivalence classes. [2025-01-10 07:02:32,688 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 07:02:32,689 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 07:02:32,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:32,689 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:32,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 07:02:32,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 07:02:32,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:32,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:32,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:32,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:32,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1257273, now seen corresponding path program 3 times [2025-01-10 07:02:32,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:32,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611288513] [2025-01-10 07:02:32,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:02:32,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:32,723 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 2 equivalence classes. [2025-01-10 07:02:32,724 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:32,725 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 07:02:32,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:32,725 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:32,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:32,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:32,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:32,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:32,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:32,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:32,727 INFO L85 PathProgramCache]: Analyzing trace with hash -345908015, now seen corresponding path program 5 times [2025-01-10 07:02:32,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:32,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691730131] [2025-01-10 07:02:32,727 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:02:32,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:32,734 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 99 statements into 49 equivalence classes. [2025-01-10 07:02:32,787 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) and asserted 99 of 99 statements. [2025-01-10 07:02:32,791 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2025-01-10 07:02:32,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 141 proven. 2162 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:02:34,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:02:34,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691730131] [2025-01-10 07:02:34,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691730131] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:02:34,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656333888] [2025-01-10 07:02:34,449 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:02:34,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:02:34,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:34,452 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:02:34,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-01-10 07:02:34,479 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 99 statements into 49 equivalence classes. [2025-01-10 07:02:34,537 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) and asserted 99 of 99 statements. [2025-01-10 07:02:34,537 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2025-01-10 07:02:34,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:34,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-10 07:02:34,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:34,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 141 proven. 2162 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:02:34,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:02:35,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 141 proven. 2162 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:02:35,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656333888] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:02:35,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:02:35,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 51 [2025-01-10 07:02:35,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344961640] [2025-01-10 07:02:35,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:02:35,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:02:35,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-01-10 07:02:35,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2025-01-10 07:02:35,984 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. cyclomatic complexity: 3 Second operand has 51 states, 51 states have (on average 2.0392156862745097) internal successors, (104), 51 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:36,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:02:36,124 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2025-01-10 07:02:36,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 110 transitions. [2025-01-10 07:02:36,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:02:36,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 107 transitions. [2025-01-10 07:02:36,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-01-10 07:02:36,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-01-10 07:02:36,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 107 transitions. [2025-01-10 07:02:36,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:36,126 INFO L218 hiAutomatonCegarLoop]: Abstraction has 105 states and 107 transitions. [2025-01-10 07:02:36,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 107 transitions. [2025-01-10 07:02:36,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2025-01-10 07:02:36,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 103 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2025-01-10 07:02:36,138 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 106 transitions. [2025-01-10 07:02:36,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-01-10 07:02:36,139 INFO L432 stractBuchiCegarLoop]: Abstraction has 104 states and 106 transitions. [2025-01-10 07:02:36,139 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-01-10 07:02:36,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 106 transitions. [2025-01-10 07:02:36,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:02:36,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:36,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:36,142 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [50, 49, 1, 1] [2025-01-10 07:02:36,142 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2025-01-10 07:02:36,142 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" [2025-01-10 07:02:36,142 INFO L754 eck$LassoCheckResult]: Loop: "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" [2025-01-10 07:02:36,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:36,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1762378640, now seen corresponding path program 6 times [2025-01-10 07:02:36,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:36,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001098527] [2025-01-10 07:02:36,147 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:02:36,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:36,154 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 101 statements into 50 equivalence classes. [2025-01-10 07:02:36,182 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 50 check-sat command(s) and asserted 101 of 101 statements. [2025-01-10 07:02:36,183 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 50 check-sat command(s) [2025-01-10 07:02:36,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:36,183 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:36,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-10 07:02:36,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-10 07:02:36,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:36,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:36,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:36,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:36,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1257273, now seen corresponding path program 4 times [2025-01-10 07:02:36,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:36,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684541989] [2025-01-10 07:02:36,217 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:02:36,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:36,220 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-01-10 07:02:36,221 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:36,221 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:02:36,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:36,221 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:36,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:36,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:36,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:36,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:36,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:36,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:36,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1353030696, now seen corresponding path program 6 times [2025-01-10 07:02:36,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:36,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651789260] [2025-01-10 07:02:36,223 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:02:36,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:36,229 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 105 statements into 52 equivalence classes. [2025-01-10 07:02:36,251 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 52 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 07:02:36,251 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 52 check-sat command(s) [2025-01-10 07:02:36,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:36,251 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:36,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 07:02:36,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 07:02:36,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:36,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:36,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:39,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-10 07:02:39,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-10 07:02:39,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:39,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:39,175 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:39,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-10 07:02:39,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-10 07:02:39,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:39,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:39,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:02:39 BoogieIcfgContainer [2025-01-10 07:02:39,298 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:02:39,299 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:02:39,299 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:02:39,299 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:02:39,300 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:02:27" (3/4) ... [2025-01-10 07:02:39,301 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-01-10 07:02:39,356 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 07:02:39,356 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:02:39,357 INFO L158 Benchmark]: Toolchain (without parser) took 12609.74ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 106.3MB in the beginning and 266.5MB in the end (delta: -160.2MB). Peak memory consumption was 229.8MB. Max. memory is 16.1GB. [2025-01-10 07:02:39,357 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:02:39,357 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.01ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 96.9MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:02:39,357 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.66ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 95.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:02:39,357 INFO L158 Benchmark]: Boogie Preprocessor took 21.64ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 94.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:02:39,358 INFO L158 Benchmark]: RCFGBuilder took 200.26ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 85.7MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:02:39,358 INFO L158 Benchmark]: BuchiAutomizer took 12128.42ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 85.7MB in the beginning and 270.5MB in the end (delta: -184.8MB). Peak memory consumption was 213.0MB. Max. memory is 16.1GB. [2025-01-10 07:02:39,358 INFO L158 Benchmark]: Witness Printer took 57.35ms. Allocated memory is still 536.9MB. Free memory was 270.5MB in the beginning and 266.5MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:02:39,360 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.33ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 175.01ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 96.9MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.66ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 95.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.64ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 94.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 200.26ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 85.7MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 12128.42ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 85.7MB in the beginning and 270.5MB in the end (delta: -184.8MB). Peak memory consumption was 213.0MB. Max. memory is 16.1GB. * Witness Printer took 57.35ms. Allocated memory is still 536.9MB. Free memory was 270.5MB in the beginning and 266.5MB in the end (delta: 3.9MB). 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 (6 trivial, 2 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function j and consists of 3 locations. One deterministic module has affine ranking function j and consists of 3 locations. One nondeterministic module has affine ranking function j and consists of 3 locations. One nondeterministic module has affine ranking function (((long) -2 * j) + 103) and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 51 locations. The remainder module has 104 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.9s and 8 iterations. TraceHistogramMax:50. Analysis of lassos took 10.8s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 14 StatesRemovedByMinimization, 8 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, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 331 IncrementalHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 51 mSDtfsCounter, 331 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc3 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital20 mio100 ax160 hnf100 lsp62 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf106 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 45ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 12]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int j; [L8] j = 100 [L9] i = 0 VAL [i=0, j=100] [L11] COND TRUE i < j VAL [i=0, j=100] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=1, j=99] [L11] COND TRUE i < j VAL [i=1, j=99] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=2, j=98] [L11] COND TRUE i < j VAL [i=2, j=98] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=3, j=97] [L11] COND TRUE i < j VAL [i=3, j=97] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=4, j=96] [L11] COND TRUE i < j VAL [i=4, j=96] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=5, j=95] [L11] COND TRUE i < j VAL [i=5, j=95] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=6, j=94] [L11] COND TRUE i < j VAL [i=6, j=94] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=7, j=93] [L11] COND TRUE i < j VAL [i=7, j=93] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=8, j=92] [L11] COND TRUE i < j VAL [i=8, j=92] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=9, j=91] [L11] COND TRUE i < j VAL [i=9, j=91] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=10, j=90] [L11] COND TRUE i < j VAL [i=10, j=90] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=11, j=89] [L11] COND TRUE i < j VAL [i=11, j=89] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=12, j=88] [L11] COND TRUE i < j VAL [i=12, j=88] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=13, j=87] [L11] COND TRUE i < j VAL [i=13, j=87] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=14, j=86] [L11] COND TRUE i < j VAL [i=14, j=86] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=15, j=85] [L11] COND TRUE i < j VAL [i=15, j=85] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=16, j=84] [L11] COND TRUE i < j VAL [i=16, j=84] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=17, j=83] [L11] COND TRUE i < j VAL [i=17, j=83] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=18, j=82] [L11] COND TRUE i < j VAL [i=18, j=82] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=19, j=81] [L11] COND TRUE i < j VAL [i=19, j=81] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=20, j=80] [L11] COND TRUE i < j VAL [i=20, j=80] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=21, j=79] [L11] COND TRUE i < j VAL [i=21, j=79] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=22, j=78] [L11] COND TRUE i < j VAL [i=22, j=78] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=23, j=77] [L11] COND TRUE i < j VAL [i=23, j=77] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=24, j=76] [L11] COND TRUE i < j VAL [i=24, j=76] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=25, j=75] [L11] COND TRUE i < j VAL [i=25, j=75] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=26, j=74] [L11] COND TRUE i < j VAL [i=26, j=74] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=27, j=73] [L11] COND TRUE i < j VAL [i=27, j=73] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=28, j=72] [L11] COND TRUE i < j VAL [i=28, j=72] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=29, j=71] [L11] COND TRUE i < j VAL [i=29, j=71] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=30, j=70] [L11] COND TRUE i < j VAL [i=30, j=70] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=31, j=69] [L11] COND TRUE i < j VAL [i=31, j=69] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=32, j=68] [L11] COND TRUE i < j VAL [i=32, j=68] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=33, j=67] [L11] COND TRUE i < j VAL [i=33, j=67] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=34, j=66] [L11] COND TRUE i < j VAL [i=34, j=66] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=35, j=65] [L11] COND TRUE i < j VAL [i=35, j=65] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=36, j=64] [L11] COND TRUE i < j VAL [i=36, j=64] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=37, j=63] [L11] COND TRUE i < j VAL [i=37, j=63] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=38, j=62] [L11] COND TRUE i < j VAL [i=38, j=62] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=39, j=61] [L11] COND TRUE i < j VAL [i=39, j=61] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=40, j=60] [L11] COND TRUE i < j VAL [i=40, j=60] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=41, j=59] [L11] COND TRUE i < j VAL [i=41, j=59] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=42, j=58] [L11] COND TRUE i < j VAL [i=42, j=58] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=43, j=57] [L11] COND TRUE i < j VAL [i=43, j=57] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=44, j=56] [L11] COND TRUE i < j VAL [i=44, j=56] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=45, j=55] [L11] COND TRUE i < j VAL [i=45, j=55] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=46, j=54] [L11] COND TRUE i < j VAL [i=46, j=54] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=47, j=53] [L11] COND TRUE i < j VAL [i=47, j=53] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=48, j=52] [L11] COND TRUE i < j VAL [i=48, j=52] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=49, j=51] [L11] COND TRUE i < j VAL [i=49, j=51] Loop: [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 12]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int j; [L8] j = 100 [L9] i = 0 VAL [i=0, j=100] [L11] COND TRUE i < j VAL [i=0, j=100] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=1, j=99] [L11] COND TRUE i < j VAL [i=1, j=99] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=2, j=98] [L11] COND TRUE i < j VAL [i=2, j=98] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=3, j=97] [L11] COND TRUE i < j VAL [i=3, j=97] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=4, j=96] [L11] COND TRUE i < j VAL [i=4, j=96] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=5, j=95] [L11] COND TRUE i < j VAL [i=5, j=95] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=6, j=94] [L11] COND TRUE i < j VAL [i=6, j=94] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=7, j=93] [L11] COND TRUE i < j VAL [i=7, j=93] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=8, j=92] [L11] COND TRUE i < j VAL [i=8, j=92] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=9, j=91] [L11] COND TRUE i < j VAL [i=9, j=91] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=10, j=90] [L11] COND TRUE i < j VAL [i=10, j=90] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=11, j=89] [L11] COND TRUE i < j VAL [i=11, j=89] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=12, j=88] [L11] COND TRUE i < j VAL [i=12, j=88] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=13, j=87] [L11] COND TRUE i < j VAL [i=13, j=87] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=14, j=86] [L11] COND TRUE i < j VAL [i=14, j=86] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=15, j=85] [L11] COND TRUE i < j VAL [i=15, j=85] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=16, j=84] [L11] COND TRUE i < j VAL [i=16, j=84] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=17, j=83] [L11] COND TRUE i < j VAL [i=17, j=83] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=18, j=82] [L11] COND TRUE i < j VAL [i=18, j=82] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=19, j=81] [L11] COND TRUE i < j VAL [i=19, j=81] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=20, j=80] [L11] COND TRUE i < j VAL [i=20, j=80] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=21, j=79] [L11] COND TRUE i < j VAL [i=21, j=79] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=22, j=78] [L11] COND TRUE i < j VAL [i=22, j=78] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=23, j=77] [L11] COND TRUE i < j VAL [i=23, j=77] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=24, j=76] [L11] COND TRUE i < j VAL [i=24, j=76] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=25, j=75] [L11] COND TRUE i < j VAL [i=25, j=75] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=26, j=74] [L11] COND TRUE i < j VAL [i=26, j=74] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=27, j=73] [L11] COND TRUE i < j VAL [i=27, j=73] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=28, j=72] [L11] COND TRUE i < j VAL [i=28, j=72] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=29, j=71] [L11] COND TRUE i < j VAL [i=29, j=71] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=30, j=70] [L11] COND TRUE i < j VAL [i=30, j=70] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=31, j=69] [L11] COND TRUE i < j VAL [i=31, j=69] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=32, j=68] [L11] COND TRUE i < j VAL [i=32, j=68] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=33, j=67] [L11] COND TRUE i < j VAL [i=33, j=67] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=34, j=66] [L11] COND TRUE i < j VAL [i=34, j=66] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=35, j=65] [L11] COND TRUE i < j VAL [i=35, j=65] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=36, j=64] [L11] COND TRUE i < j VAL [i=36, j=64] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=37, j=63] [L11] COND TRUE i < j VAL [i=37, j=63] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=38, j=62] [L11] COND TRUE i < j VAL [i=38, j=62] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=39, j=61] [L11] COND TRUE i < j VAL [i=39, j=61] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=40, j=60] [L11] COND TRUE i < j VAL [i=40, j=60] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=41, j=59] [L11] COND TRUE i < j VAL [i=41, j=59] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=42, j=58] [L11] COND TRUE i < j VAL [i=42, j=58] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=43, j=57] [L11] COND TRUE i < j VAL [i=43, j=57] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=44, j=56] [L11] COND TRUE i < j VAL [i=44, j=56] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=45, j=55] [L11] COND TRUE i < j VAL [i=45, j=55] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=46, j=54] [L11] COND TRUE i < j VAL [i=46, j=54] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=47, j=53] [L11] COND TRUE i < j VAL [i=47, j=53] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=48, j=52] [L11] COND TRUE i < j VAL [i=48, j=52] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=49, j=51] [L11] COND TRUE i < j VAL [i=49, j=51] Loop: [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-01-10 07:02:39,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-01-10 07:02:39,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-01-10 07:02:39,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-01-10 07:02:39,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-01-10 07:02:40,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-10 07:02:40,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)