./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-bwb/or-01.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-bwb/or-01.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 7f247e4473503f47ee3194e296d6b905e51586799395e11124f119da43a61cc2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:59:16,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:59:16,370 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-01-10 06:59:16,376 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:59:16,377 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:59:16,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:59:16,404 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:59:16,404 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:59:16,405 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:59:16,405 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:59:16,405 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:59:16,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:59:16,406 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:59:16,406 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 06:59:16,406 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 06:59:16,406 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 06:59:16,406 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 06:59:16,406 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 06:59:16,407 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 06:59:16,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:59:16,407 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 06:59:16,408 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:59:16,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:59:16,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 06:59:16,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 06:59:16,408 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 06:59:16,408 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:59:16,408 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:59:16,408 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 06:59:16,408 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:59:16,409 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:59:16,409 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:59:16,409 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:59:16,409 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:59:16,409 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:59:16,409 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 06:59:16,411 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 -> 7f247e4473503f47ee3194e296d6b905e51586799395e11124f119da43a61cc2 [2025-01-10 06:59:16,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:59:16,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:59:16,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:59:16,719 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:59:16,719 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:59:16,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-bwb/or-01.c [2025-01-10 06:59:18,046 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54138c2d1/b87458b4dd0343b89d8cd7a3e10ae31f/FLAGa15e85a73 [2025-01-10 06:59:18,297 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:59:18,297 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-bwb/or-01.c [2025-01-10 06:59:18,304 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54138c2d1/b87458b4dd0343b89d8cd7a3e10ae31f/FLAGa15e85a73 [2025-01-10 06:59:18,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54138c2d1/b87458b4dd0343b89d8cd7a3e10ae31f [2025-01-10 06:59:18,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:59:18,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:59:18,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:59:18,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:59:18,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:59:18,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:59:18" (1/1) ... [2025-01-10 06:59:18,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a53a3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:18, skipping insertion in model container [2025-01-10 06:59:18,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:59:18" (1/1) ... [2025-01-10 06:59:18,642 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:59:18,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:59:18,769 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:59:18,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:59:18,794 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:59:18,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:18 WrapperNode [2025-01-10 06:59:18,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:59:18,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:59:18,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:59:18,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:59:18,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:18" (1/1) ... [2025-01-10 06:59:18,807 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:18" (1/1) ... [2025-01-10 06:59:18,821 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2025-01-10 06:59:18,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:59:18,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:59:18,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:59:18,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:59:18,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:18" (1/1) ... [2025-01-10 06:59:18,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:18" (1/1) ... [2025-01-10 06:59:18,830 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:18" (1/1) ... [2025-01-10 06:59:18,835 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 06:59:18,838 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:18" (1/1) ... [2025-01-10 06:59:18,838 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:18" (1/1) ... [2025-01-10 06:59:18,839 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:18" (1/1) ... [2025-01-10 06:59:18,840 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:18" (1/1) ... [2025-01-10 06:59:18,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:18" (1/1) ... [2025-01-10 06:59:18,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:18" (1/1) ... [2025-01-10 06:59:18,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:18" (1/1) ... [2025-01-10 06:59:18,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:59:18,850 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:59:18,850 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:59:18,850 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:59:18,851 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:18" (1/1) ... [2025-01-10 06:59:18,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:18,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:18,886 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 06:59:18,897 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 06:59:18,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:59:18,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:59:18,961 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:59:18,963 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:59:19,046 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-01-10 06:59:19,047 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:59:19,054 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:59:19,054 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:59:19,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:59:19 BoogieIcfgContainer [2025-01-10 06:59:19,055 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:59:19,056 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 06:59:19,056 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 06:59:19,061 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 06:59:19,062 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 06:59:19,062 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 06:59:18" (1/3) ... [2025-01-10 06:59:19,063 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c6a1535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 06:59:19, skipping insertion in model container [2025-01-10 06:59:19,063 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 06:59:19,063 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:18" (2/3) ... [2025-01-10 06:59:19,064 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c6a1535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 06:59:19, skipping insertion in model container [2025-01-10 06:59:19,064 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 06:59:19,064 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:59:19" (3/3) ... [2025-01-10 06:59:19,065 INFO L363 chiAutomizerObserver]: Analyzing ICFG or-01.c [2025-01-10 06:59:19,101 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 06:59:19,101 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 06:59:19,101 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 06:59:19,102 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 06:59:19,102 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 06:59:19,102 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 06:59:19,102 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 06:59:19,102 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 06:59:19,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 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 06:59:19,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 06:59:19,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:19,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:19,124 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 06:59:19,124 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 06:59:19,124 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 06:59:19,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 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 06:59:19,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 06:59:19,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:19,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:19,126 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 06:59:19,126 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 06:59:19,130 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_#t~nondet0#1, main_#t~post1#1, main_#t~bitwise2#1, main_~a~0#1, main_~b~0#1, main_~x~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;main_~a~0#1 := 16;main_~b~0#1 := 30;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" [2025-01-10 06:59:19,130 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume 0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1;main_#t~bitwise2#1 := main_~a~0#1;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" [2025-01-10 06:59:19,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:19,135 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 06:59:19,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:19,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140149989] [2025-01-10 06:59:19,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:19,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:19,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:19,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:19,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:19,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:19,205 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:19,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:19,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:19,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:19,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:19,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:19,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:19,221 INFO L85 PathProgramCache]: Analyzing trace with hash 35855, now seen corresponding path program 1 times [2025-01-10 06:59:19,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:19,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103924711] [2025-01-10 06:59:19,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:19,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:19,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:19,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:19,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:19,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:19,233 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:19,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:19,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:19,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:19,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:19,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:19,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:19,240 INFO L85 PathProgramCache]: Analyzing trace with hash 28694797, now seen corresponding path program 1 times [2025-01-10 06:59:19,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:19,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584360832] [2025-01-10 06:59:19,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:19,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:19,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:59:19,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:19,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:19,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:19,366 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 06:59:19,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:59:19,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584360832] [2025-01-10 06:59:19,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584360832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:59:19,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:59:19,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:59:19,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262165005] [2025-01-10 06:59:19,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:59:19,482 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:19,483 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:19,483 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:19,484 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:19,484 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 06:59:19,485 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:19,485 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:19,485 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:19,485 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration1_Loop [2025-01-10 06:59:19,485 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:19,486 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:19,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:19,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:19,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:19,652 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:19,652 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 06:59:19,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:19,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:19,658 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 06:59:19,661 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 06:59:19,662 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:19,662 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:19,682 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:19,682 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:19,688 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 06:59:19,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:19,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:19,691 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 06:59:19,692 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 06:59:19,693 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:19,693 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:19,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-01-10 06:59:19,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:19,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:19,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 06:59:19,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 06:59:19,717 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 06:59:19,717 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:19,979 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 06:59:19,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:19,990 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:19,990 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:19,990 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:19,990 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:19,990 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 06:59:19,990 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:19,990 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:19,990 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:19,990 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration1_Loop [2025-01-10 06:59:19,990 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:19,990 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:19,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:19,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:20,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:20,100 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:20,104 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 06:59:20,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:20,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:20,109 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 06:59:20,112 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 06:59:20,114 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 06:59:20,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:20,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:20,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:20,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:20,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:20,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:20,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:20,140 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:20,148 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 06:59:20,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:20,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:20,151 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 06:59:20,154 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 06:59:20,156 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 06:59:20,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:20,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:20,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:20,169 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-01-10 06:59:20,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:20,175 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 06:59:20,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:20,184 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:20,191 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 06:59:20,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:20,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:20,194 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 06:59:20,198 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 06:59:20,198 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 06:59:20,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:20,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:20,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:20,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:20,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:20,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:20,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:20,216 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:20,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:20,224 INFO L451 LassoAnalysis]: Using template '2-nested'. [2025-01-10 06:59:20,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:20,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:20,228 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 06:59:20,230 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 06:59:20,230 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 06:59:20,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:20,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:20,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:20,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:20,242 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 06:59:20,242 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 06:59:20,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:20,245 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:20,250 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 06:59:20,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:20,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:20,253 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 06:59:20,253 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 06:59:20,254 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 06:59:20,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:20,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:20,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:20,265 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-01-10 06:59:20,265 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 06:59:20,273 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:20,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:20,281 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 06:59:20,298 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-01-10 06:59:20,301 INFO L444 ModelExtractionUtils]: 4 out of 9 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-01-10 06:59:20,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:20,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:20,308 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 06:59:20,309 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 06:59:20,309 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 06:59:20,310 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 06:59:20,310 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 06:59:20,310 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = -1*ULTIMATE.start_main_~a~0#1 f1 = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2025-01-10 06:59:20,317 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 06:59:20,324 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 06:59:20,332 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression [2025-01-10 06:59:20,333 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression [2025-01-10 06:59:20,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:20,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:20,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:20,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:20,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:20,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:20,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:20,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:20,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:20,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:20,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:20,384 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 06:59:20,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:20,560 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 06:59:20,588 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-01-10 06:59:20,591 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:20,736 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 33 transitions. Complement of second has 9 states. [2025-01-10 06:59:20,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:20,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:20,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2025-01-10 06:59:20,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 2 letters. Loop has 3 letters. [2025-01-10 06:59:20,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:20,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 5 letters. Loop has 3 letters. [2025-01-10 06:59:20,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:20,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 2 letters. Loop has 6 letters. [2025-01-10 06:59:20,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:20,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2025-01-10 06:59:20,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 06:59:20,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 23 transitions. [2025-01-10 06:59:20,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-01-10 06:59:20,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-01-10 06:59:20,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2025-01-10 06:59:20,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:20,765 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-01-10 06:59:20,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2025-01-10 06:59:20,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2025-01-10 06:59:20,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 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 06:59:20,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2025-01-10 06:59:20,784 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2025-01-10 06:59:20,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:59:20,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:59:20,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:59:20,788 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:20,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:59:20,821 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2025-01-10 06:59:20,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2025-01-10 06:59:20,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 06:59:20,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2025-01-10 06:59:20,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-01-10 06:59:20,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-01-10 06:59:20,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2025-01-10 06:59:20,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:20,824 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2025-01-10 06:59:20,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2025-01-10 06:59:20,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-01-10 06:59:20,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 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 06:59:20,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2025-01-10 06:59:20,825 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2025-01-10 06:59:20,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:59:20,826 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2025-01-10 06:59:20,826 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 06:59:20,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2025-01-10 06:59:20,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 06:59:20,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:20,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:20,827 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-01-10 06:59:20,827 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 06:59:20,827 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_#t~nondet0#1, main_#t~post1#1, main_#t~bitwise2#1, main_~a~0#1, main_~b~0#1, main_~x~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;main_~a~0#1 := 16;main_~b~0#1 := 30;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume 0 == main_~a~0#1;main_#t~bitwise2#1 := main_~b~0#1;" [2025-01-10 06:59:20,828 INFO L754 eck$LassoCheckResult]: Loop: "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume 0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1;main_#t~bitwise2#1 := main_~a~0#1;" [2025-01-10 06:59:20,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:20,828 INFO L85 PathProgramCache]: Analyzing trace with hash 28694854, now seen corresponding path program 1 times [2025-01-10 06:59:20,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:20,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794820351] [2025-01-10 06:59:20,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:20,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:20,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:59:20,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:20,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:20,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:20,889 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 06:59:20,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:59:20,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794820351] [2025-01-10 06:59:20,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794820351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:59:20,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:59:20,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:59:20,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097253398] [2025-01-10 06:59:20,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:59:20,891 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 06:59:20,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:20,892 INFO L85 PathProgramCache]: Analyzing trace with hash 48245, now seen corresponding path program 2 times [2025-01-10 06:59:20,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:20,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303206493] [2025-01-10 06:59:20,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:59:20,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:20,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:20,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:20,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:59:20,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:20,899 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:20,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:20,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:20,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:20,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:20,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:20,965 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:20,965 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:20,965 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:20,966 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:20,966 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 06:59:20,966 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:20,966 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:20,966 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:20,966 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration2_Loop [2025-01-10 06:59:20,966 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:20,966 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:20,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:20,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:20,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:21,070 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:21,071 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 06:59:21,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:21,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:21,074 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 06:59:21,077 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 06:59:21,078 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:21,078 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:21,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:21,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:21,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:21,103 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 06:59:21,106 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 06:59:21,106 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:21,110 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 06:59:21,334 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 06:59:21,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:21,342 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:21,342 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:21,342 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:21,342 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:21,342 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 06:59:21,342 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:21,342 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:21,342 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:21,342 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration2_Loop [2025-01-10 06:59:21,342 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:21,342 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:21,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:21,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:21,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:21,436 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:21,436 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 06:59:21,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:21,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:21,439 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 06:59:21,440 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 06:59:21,441 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 06:59:21,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:21,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:21,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:21,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:21,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:21,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:21,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:21,453 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:21,461 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 06:59:21,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:21,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:21,464 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 06:59:21,466 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 06:59:21,467 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 06:59:21,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:21,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:21,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:21,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:21,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:21,478 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:21,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:21,481 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:21,488 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 06:59:21,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:21,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:21,490 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 06:59:21,491 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 06:59:21,492 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 06:59:21,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:21,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:21,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:21,504 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-01-10 06:59:21,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:21,508 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 06:59:21,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:21,513 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:21,520 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 06:59:21,520 INFO L451 LassoAnalysis]: Using template '2-nested'. [2025-01-10 06:59:21,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:21,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:21,522 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:21,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-01-10 06:59:21,524 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 06:59:21,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:21,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:21,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:21,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:21,534 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 06:59:21,535 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 06:59:21,535 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:21,537 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:21,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:21,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:21,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:21,544 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 06:59:21,546 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 06:59:21,547 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 06:59:21,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:21,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:21,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:21,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:21,557 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 06:59:21,559 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 06:59:21,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:21,561 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:21,569 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 06:59:21,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:21,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:21,571 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 06:59:21,574 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 06:59:21,575 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 06:59:21,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:21,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:21,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:21,589 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-01-10 06:59:21,589 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 06:59:21,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:21,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:21,608 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 06:59:21,615 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-01-10 06:59:21,616 INFO L444 ModelExtractionUtils]: 3 out of 9 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-01-10 06:59:21,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:21,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:21,618 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 06:59:21,619 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 06:59:21,620 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 06:59:21,620 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 06:59:21,620 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 06:59:21,620 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = -1*ULTIMATE.start_main_~a~0#1 f1 = 1*ULTIMATE.start_main_~x~0#1 - 1*ULTIMATE.start_main_#t~bitwise2#1 Supporting invariants [] [2025-01-10 06:59:21,626 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 06:59:21,628 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 06:59:21,629 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression [2025-01-10 06:59:21,630 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression [2025-01-10 06:59:21,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:21,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:59:21,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:21,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:21,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:21,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:21,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:21,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:21,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:21,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:21,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:21,665 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 06:59:21,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:21,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-01-10 06:59:21,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-01-10 06:59:21,851 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 06:59:21,851 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-01-10 06:59:21,852 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 06:59:21,887 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 29 states and 37 transitions. Complement of second has 7 states. [2025-01-10 06:59:21,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:21,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 06:59:21,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2025-01-10 06:59:21,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 3 letters. [2025-01-10 06:59:21,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:21,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 3 letters. [2025-01-10 06:59:21,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:21,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 6 letters. [2025-01-10 06:59:21,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:21,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2025-01-10 06:59:21,890 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-01-10 06:59:21,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 27 states and 35 transitions. [2025-01-10 06:59:21,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-01-10 06:59:21,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-01-10 06:59:21,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2025-01-10 06:59:21,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:21,892 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-01-10 06:59:21,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2025-01-10 06:59:21,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-01-10 06:59:21,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:21,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2025-01-10 06:59:21,894 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 33 transitions. [2025-01-10 06:59:21,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:59:21,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:59:21,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:59:21,895 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:21,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:59:21,907 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2025-01-10 06:59:21,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2025-01-10 06:59:21,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 06:59:21,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 10 states and 11 transitions. [2025-01-10 06:59:21,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-01-10 06:59:21,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-01-10 06:59:21,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2025-01-10 06:59:21,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 06:59:21,908 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-01-10 06:59:21,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2025-01-10 06:59:21,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-01-10 06:59:21,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:21,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2025-01-10 06:59:21,909 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-01-10 06:59:21,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:59:21,913 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-01-10 06:59:21,913 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 06:59:21,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2025-01-10 06:59:21,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 06:59:21,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:21,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:21,913 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 06:59:21,913 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 06:59:21,913 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_#t~nondet0#1, main_#t~post1#1, main_#t~bitwise2#1, main_~a~0#1, main_~b~0#1, main_~x~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;main_~a~0#1 := 16;main_~b~0#1 := 30;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" [2025-01-10 06:59:21,914 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" [2025-01-10 06:59:21,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:21,914 INFO L85 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2025-01-10 06:59:21,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:21,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945390334] [2025-01-10 06:59:21,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:21,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:21,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:21,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:21,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:21,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:21,920 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:21,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:21,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:21,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:21,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:21,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:21,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:21,924 INFO L85 PathProgramCache]: Analyzing trace with hash 43930390, now seen corresponding path program 1 times [2025-01-10 06:59:21,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:21,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344509786] [2025-01-10 06:59:21,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:21,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:21,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:59:21,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:21,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:21,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:21,943 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:21,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:59:21,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:21,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:21,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:21,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:21,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:21,955 INFO L85 PathProgramCache]: Analyzing trace with hash 354416559, now seen corresponding path program 1 times [2025-01-10 06:59:21,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:21,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157697330] [2025-01-10 06:59:21,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:21,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:21,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:59:21,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:59:21,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:21,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:21,963 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:21,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:59:21,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:59:21,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:21,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:21,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:22,199 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:22,200 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:22,200 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:22,200 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:22,200 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 06:59:22,200 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:22,200 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:22,200 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:22,200 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration3_Loop [2025-01-10 06:59:22,200 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:22,201 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:22,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:22,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:22,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:22,322 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-01-10 06:59:22,777 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:22,778 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 06:59:22,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:22,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:22,780 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 06:59:22,783 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 06:59:22,784 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:22,784 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:22,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-01-10 06:59:22,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:22,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:22,825 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 06:59:22,827 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 06:59:22,828 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 06:59:22,828 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:22,867 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:22,867 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=-1, ULTIMATE.start_main_~a~0#1=1, ULTIMATE.start_main_~b~0#1=-2} Honda state: {ULTIMATE.start_main_~x~0#1=-1, ULTIMATE.start_main_~a~0#1=1, ULTIMATE.start_main_~b~0#1=-2} Generalized eigenvectors: [{ULTIMATE.start_main_~x~0#1=0, ULTIMATE.start_main_~a~0#1=0, ULTIMATE.start_main_~b~0#1=0}, {ULTIMATE.start_main_~x~0#1=1, ULTIMATE.start_main_~a~0#1=0, ULTIMATE.start_main_~b~0#1=0}, {ULTIMATE.start_main_~x~0#1=1, ULTIMATE.start_main_~a~0#1=1, ULTIMATE.start_main_~b~0#1=0}] Lambdas: [2, 1, 1] Nus: [0, 0] [2025-01-10 06:59:22,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-01-10 06:59:22,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:22,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:22,876 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 06:59:22,877 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 06:59:22,878 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:22,878 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:22,894 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:22,894 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~bitwise2#1=0} Honda state: {ULTIMATE.start_main_#t~bitwise2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:22,901 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 06:59:22,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:22,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:22,904 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:22,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-01-10 06:59:22,907 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:22,907 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:22,921 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:22,921 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:22,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:22,956 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:22,957 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:22,957 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:22,957 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:22,957 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 06:59:22,957 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:22,957 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:22,957 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:22,957 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration3_Lasso [2025-01-10 06:59:22,957 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:22,958 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:22,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:22,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:22,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:23,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:23,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:23,105 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-01-10 06:59:23,525 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:23,527 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 06:59:23,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:23,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:23,529 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 06:59:23,531 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 06:59:23,532 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:23,532 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:23,546 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:23,546 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~bitwise2#1=0} Honda state: {ULTIMATE.start_main_#t~bitwise2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:23,553 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 06:59:23,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:23,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:23,556 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 06:59:23,558 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 06:59:23,560 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:23,560 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:23,575 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:23,575 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0#1=0} Honda state: {ULTIMATE.start_main_#t~nondet0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:23,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:23,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:23,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:23,583 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 06:59:23,584 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 06:59:23,586 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:23,586 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:23,609 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 06:59:23,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:23,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:23,612 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 06:59:23,614 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 06:59:23,615 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 06:59:23,615 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:23,645 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 06:59:23,650 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 06:59:23,650 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:23,650 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:23,650 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:23,650 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:23,650 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 06:59:23,650 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:23,650 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:23,650 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:23,651 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration3_Lasso [2025-01-10 06:59:23,651 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:23,651 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:23,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:23,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:23,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:23,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:23,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:23,785 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-01-10 06:59:24,158 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:24,158 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 06:59:24,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:24,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:24,161 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:24,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-01-10 06:59:24,166 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 06:59:24,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:24,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:24,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:24,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:24,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:24,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:24,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:24,178 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:24,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:24,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:24,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:24,185 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:24,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-01-10 06:59:24,187 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 06:59:24,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:24,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:24,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:24,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:24,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:24,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:24,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:24,201 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:24,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-01-10 06:59:24,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:24,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:24,211 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:24,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-01-10 06:59:24,214 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 06:59:24,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:24,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:24,227 INFO L204 nArgumentSynthesizer]: 7 loop disjuncts [2025-01-10 06:59:24,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:24,311 INFO L401 nArgumentSynthesizer]: We have 126 Motzkin's Theorem applications. [2025-01-10 06:59:24,311 INFO L402 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2025-01-10 06:59:25,459 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 06:59:26,082 INFO L443 ModelExtractionUtils]: Simplification made 25 calls to the SMT solver. [2025-01-10 06:59:26,083 INFO L444 ModelExtractionUtils]: 30 out of 61 variables were initially zero. Simplification set additionally 25 variables to zero. [2025-01-10 06:59:26,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:26,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:26,086 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:26,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-01-10 06:59:26,087 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 06:59:26,109 INFO L438 nArgumentSynthesizer]: Removed 13 redundant supporting invariants from a total of 14. [2025-01-10 06:59:26,109 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 06:59:26,109 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~a~0#1) = -2*ULTIMATE.start_main_~a~0#1 + 4294967295 Supporting invariants [2*ULTIMATE.start_main_~b~0#1 - 2*ULTIMATE.start_main_~a~0#1 + 3 >= 0] [2025-01-10 06:59:26,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-01-10 06:59:26,132 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-01-10 06:59:26,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:26,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:26,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:26,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:26,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:26,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:59:26,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:26,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:59:26,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:26,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:26,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:26,229 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 06:59:26,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:26,355 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 06:59:26,356 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 5 loop predicates [2025-01-10 06:59:26,356 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 8 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 06:59:26,438 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2. Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 8 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) Result 21 states and 24 transitions. Complement of second has 13 states. [2025-01-10 06:59:26,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 4 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:26,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 8 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 06:59:26,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2025-01-10 06:59:26,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. Stem has 4 letters. Loop has 5 letters. [2025-01-10 06:59:26,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:26,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. Stem has 9 letters. Loop has 5 letters. [2025-01-10 06:59:26,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:26,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. Stem has 4 letters. Loop has 10 letters. [2025-01-10 06:59:26,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:26,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2025-01-10 06:59:26,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 06:59:26,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 18 transitions. [2025-01-10 06:59:26,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-01-10 06:59:26,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-01-10 06:59:26,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2025-01-10 06:59:26,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 06:59:26,441 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-01-10 06:59:26,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2025-01-10 06:59:26,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-01-10 06:59:26,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 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 06:59:26,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2025-01-10 06:59:26,442 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-01-10 06:59:26,442 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-01-10 06:59:26,442 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 06:59:26,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2025-01-10 06:59:26,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 06:59:26,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:26,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:26,443 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:59:26,443 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 06:59:26,443 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_#t~nondet0#1, main_#t~post1#1, main_#t~bitwise2#1, main_~a~0#1, main_~b~0#1, main_~x~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;main_~a~0#1 := 16;main_~b~0#1 := 30;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume 0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1;main_#t~bitwise2#1 := main_~a~0#1;" [2025-01-10 06:59:26,443 INFO L754 eck$LassoCheckResult]: Loop: "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume 0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1;main_#t~bitwise2#1 := main_~a~0#1;" [2025-01-10 06:59:26,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:26,443 INFO L85 PathProgramCache]: Analyzing trace with hash 354416557, now seen corresponding path program 1 times [2025-01-10 06:59:26,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:26,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489348933] [2025-01-10 06:59:26,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:26,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:26,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:59:26,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:59:26,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:26,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:26,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:26,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:59:26,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489348933] [2025-01-10 06:59:26,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489348933] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:59:26,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460115208] [2025-01-10 06:59:26,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:26,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:59:26,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:26,636 INFO L229 MonitoredProcess]: Starting monitored process 32 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 06:59:26,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-01-10 06:59:26,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:59:26,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:59:26,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:26,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:26,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 06:59:26,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:26,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:26,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:59:26,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:26,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:26,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460115208] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:59:26,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:59:26,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 15 [2025-01-10 06:59:26,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310070972] [2025-01-10 06:59:26,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:59:26,893 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 06:59:26,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:26,893 INFO L85 PathProgramCache]: Analyzing trace with hash 48245, now seen corresponding path program 3 times [2025-01-10 06:59:26,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:26,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556188357] [2025-01-10 06:59:26,894 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:59:26,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:26,898 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:26,901 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:26,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:59:26,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:26,905 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:26,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:26,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:26,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:26,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:26,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:26,951 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:26,952 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:26,952 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:26,952 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:26,952 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 06:59:26,952 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:26,952 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:26,952 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:26,952 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration4_Loop [2025-01-10 06:59:26,952 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:26,952 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:26,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:26,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:26,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:27,032 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:27,032 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 06:59:27,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:27,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:27,035 INFO L229 MonitoredProcess]: Starting monitored process 33 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 06:59:27,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-01-10 06:59:27,038 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:27,038 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:27,054 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:27,054 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:27,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:27,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:27,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:27,063 INFO L229 MonitoredProcess]: Starting monitored process 34 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 06:59:27,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-01-10 06:59:27,065 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:27,065 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:27,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-01-10 06:59:27,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:27,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:27,082 INFO L229 MonitoredProcess]: Starting monitored process 35 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 06:59:27,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-01-10 06:59:27,084 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 06:59:27,084 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:27,213 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 06:59:27,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:27,219 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:27,220 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:27,220 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:27,220 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:27,220 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 06:59:27,220 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:27,220 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:27,220 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:27,220 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration4_Loop [2025-01-10 06:59:27,220 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:27,220 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:27,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:27,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:27,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:27,302 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:27,302 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 06:59:27,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:27,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:27,305 INFO L229 MonitoredProcess]: Starting monitored process 36 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 06:59:27,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-01-10 06:59:27,306 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 06:59:27,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:27,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:27,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:27,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:27,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:27,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:27,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:27,318 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:27,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:27,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:27,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:27,325 INFO L229 MonitoredProcess]: Starting monitored process 37 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 06:59:27,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-01-10 06:59:27,327 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 06:59:27,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:27,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:27,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:27,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:27,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:27,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:27,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:27,338 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:27,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-01-10 06:59:27,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:27,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:27,348 INFO L229 MonitoredProcess]: Starting monitored process 38 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 06:59:27,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-01-10 06:59:27,349 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 06:59:27,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:27,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:27,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:27,360 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-01-10 06:59:27,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:27,362 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 06:59:27,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:27,366 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:27,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-01-10 06:59:27,375 INFO L451 LassoAnalysis]: Using template '2-nested'. [2025-01-10 06:59:27,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:27,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:27,377 INFO L229 MonitoredProcess]: Starting monitored process 39 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 06:59:27,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-01-10 06:59:27,380 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 06:59:27,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:27,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:27,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:27,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:27,394 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 06:59:27,394 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 06:59:27,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:27,396 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:27,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:27,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:27,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:27,406 INFO L229 MonitoredProcess]: Starting monitored process 40 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 06:59:27,409 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 06:59:27,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-01-10 06:59:27,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:27,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:27,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:27,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:27,423 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 06:59:27,424 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 06:59:27,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:27,426 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:27,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:27,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:27,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:27,436 INFO L229 MonitoredProcess]: Starting monitored process 41 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 06:59:27,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-01-10 06:59:27,439 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 06:59:27,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:27,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:27,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:27,449 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-01-10 06:59:27,449 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 06:59:27,453 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:27,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:27,457 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 06:59:27,463 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-01-10 06:59:27,463 INFO L444 ModelExtractionUtils]: 3 out of 9 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-01-10 06:59:27,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:27,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:27,465 INFO L229 MonitoredProcess]: Starting monitored process 42 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 06:59:27,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-01-10 06:59:27,466 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 06:59:27,466 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 06:59:27,466 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 06:59:27,466 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = -1*ULTIMATE.start_main_~a~0#1 f1 = -1*ULTIMATE.start_main_#t~bitwise2#1 + 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2025-01-10 06:59:27,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:27,473 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 06:59:27,475 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression [2025-01-10 06:59:27,475 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression [2025-01-10 06:59:27,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:27,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:59:27,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:59:27,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:27,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:27,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:27,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:27,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:27,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:27,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:27,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:27,523 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 06:59:27,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:27,646 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 06:59:27,646 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-01-10 06:59:27,646 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:27,672 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27 states and 31 transitions. Complement of second has 7 states. [2025-01-10 06:59:27,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:27,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:27,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2025-01-10 06:59:27,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2025-01-10 06:59:27,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:27,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2025-01-10 06:59:27,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:27,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2025-01-10 06:59:27,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:27,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2025-01-10 06:59:27,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 06:59:27,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 28 transitions. [2025-01-10 06:59:27,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-01-10 06:59:27,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-01-10 06:59:27,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2025-01-10 06:59:27,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:27,676 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-01-10 06:59:27,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2025-01-10 06:59:27,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2025-01-10 06:59:27,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:27,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-01-10 06:59:27,678 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-01-10 06:59:27,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:59:27,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 06:59:27,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-01-10 06:59:27,678 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:27,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:59:27,734 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2025-01-10 06:59:27,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2025-01-10 06:59:27,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 06:59:27,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 34 transitions. [2025-01-10 06:59:27,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-01-10 06:59:27,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-01-10 06:59:27,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 34 transitions. [2025-01-10 06:59:27,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:27,736 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-01-10 06:59:27,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 34 transitions. [2025-01-10 06:59:27,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-01-10 06:59:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2025-01-10 06:59:27,738 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-01-10 06:59:27,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:59:27,738 INFO L432 stractBuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-01-10 06:59:27,738 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 06:59:27,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 34 transitions. [2025-01-10 06:59:27,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 06:59:27,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:27,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:27,740 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 1, 1, 1] [2025-01-10 06:59:27,740 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 06:59:27,741 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_#t~nondet0#1, main_#t~post1#1, main_#t~bitwise2#1, main_~a~0#1, main_~b~0#1, main_~x~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;main_~a~0#1 := 16;main_~b~0#1 := 30;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume 0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1;main_#t~bitwise2#1 := main_~a~0#1;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" [2025-01-10 06:59:27,741 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" [2025-01-10 06:59:27,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:27,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1943597653, now seen corresponding path program 2 times [2025-01-10 06:59:27,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:27,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519750828] [2025-01-10 06:59:27,742 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:59:27,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:27,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 06:59:27,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 06:59:27,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:59:27,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:27,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-01-10 06:59:28,079 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:28,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:59:28,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519750828] [2025-01-10 06:59:28,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519750828] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:59:28,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003364368] [2025-01-10 06:59:28,079 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:59:28,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:59:28,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:28,081 INFO L229 MonitoredProcess]: Starting monitored process 43 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 06:59:28,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2025-01-10 06:59:28,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 06:59:28,112 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 06:59:28,112 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:59:28,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:28,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 06:59:28,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:28,271 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:28,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:59:28,598 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:28,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003364368] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:59:28,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:59:28,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 30 [2025-01-10 06:59:28,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845923835] [2025-01-10 06:59:28,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:59:28,599 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 06:59:28,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:28,599 INFO L85 PathProgramCache]: Analyzing trace with hash 43930390, now seen corresponding path program 2 times [2025-01-10 06:59:28,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:28,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398153158] [2025-01-10 06:59:28,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:59:28,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:28,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:59:28,604 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:28,604 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:59:28,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:28,604 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:28,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:59:28,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:28,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:28,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:28,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:28,788 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:28,788 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:28,788 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:28,789 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:28,789 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 06:59:28,789 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:28,789 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:28,789 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:28,789 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration5_Loop [2025-01-10 06:59:28,789 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:28,789 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:28,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:28,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:28,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:28,879 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-01-10 06:59:29,173 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:29,173 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 06:59:29,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:29,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:29,176 INFO L229 MonitoredProcess]: Starting monitored process 44 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 06:59:29,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-01-10 06:59:29,180 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:29,180 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:29,196 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:29,196 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:29,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:29,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:29,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:29,207 INFO L229 MonitoredProcess]: Starting monitored process 45 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 06:59:29,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-01-10 06:59:29,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:29,210 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:29,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:29,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:29,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:29,241 INFO L229 MonitoredProcess]: Starting monitored process 46 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 06:59:29,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-01-10 06:59:29,243 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 06:59:29,243 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:29,277 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:29,277 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=-2, ULTIMATE.start_main_~a~0#1=1, ULTIMATE.start_main_~b~0#1=-3} Honda state: {ULTIMATE.start_main_~x~0#1=-2, ULTIMATE.start_main_~a~0#1=1, ULTIMATE.start_main_~b~0#1=-3} Generalized eigenvectors: [{ULTIMATE.start_main_~x~0#1=0, ULTIMATE.start_main_~a~0#1=0, ULTIMATE.start_main_~b~0#1=0}, {ULTIMATE.start_main_~x~0#1=3, ULTIMATE.start_main_~a~0#1=1, ULTIMATE.start_main_~b~0#1=0}, {ULTIMATE.start_main_~x~0#1=0, ULTIMATE.start_main_~a~0#1=0, ULTIMATE.start_main_~b~0#1=0}] Lambdas: [2, 1, 1] Nus: [0, 1] [2025-01-10 06:59:29,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-01-10 06:59:29,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:29,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:29,285 INFO L229 MonitoredProcess]: Starting monitored process 47 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 06:59:29,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-01-10 06:59:29,289 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:29,289 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:29,304 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:29,304 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~bitwise2#1=0} Honda state: {ULTIMATE.start_main_#t~bitwise2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:29,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:29,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:59:29,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-10 06:59:29,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=669, Unknown=0, NotChecked=0, Total=870 [2025-01-10 06:59:29,314 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. cyclomatic complexity: 7 Second operand has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 30 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:29,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:59:29,491 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2025-01-10 06:59:29,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 54 transitions. [2025-01-10 06:59:29,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 06:59:29,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 54 transitions. [2025-01-10 06:59:29,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-01-10 06:59:29,493 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-01-10 06:59:29,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 54 transitions. [2025-01-10 06:59:29,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:29,493 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 54 transitions. [2025-01-10 06:59:29,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 54 transitions. [2025-01-10 06:59:29,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-10 06:59:29,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.08) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:29,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2025-01-10 06:59:29,495 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 54 transitions. [2025-01-10 06:59:29,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 06:59:29,496 INFO L432 stractBuchiCegarLoop]: Abstraction has 50 states and 54 transitions. [2025-01-10 06:59:29,496 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 06:59:29,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 54 transitions. [2025-01-10 06:59:29,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 06:59:29,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:29,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:29,498 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 8, 7, 7, 1, 1, 1] [2025-01-10 06:59:29,498 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 06:59:29,498 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_#t~nondet0#1, main_#t~post1#1, main_#t~bitwise2#1, main_~a~0#1, main_~b~0#1, main_~x~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;main_~a~0#1 := 16;main_~b~0#1 := 30;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume 0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1;main_#t~bitwise2#1 := main_~a~0#1;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" [2025-01-10 06:59:29,498 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" [2025-01-10 06:59:29,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:29,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1878845845, now seen corresponding path program 3 times [2025-01-10 06:59:29,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:29,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126659823] [2025-01-10 06:59:29,502 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:59:29,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:29,508 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 9 equivalence classes. [2025-01-10 06:59:29,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 06:59:29,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-01-10 06:59:29,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:30,251 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 23 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:30,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:59:30,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126659823] [2025-01-10 06:59:30,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126659823] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:59:30,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174564686] [2025-01-10 06:59:30,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:59:30,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:59:30,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:30,254 INFO L229 MonitoredProcess]: Starting monitored process 48 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 06:59:30,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2025-01-10 06:59:30,278 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 9 equivalence classes. [2025-01-10 06:59:30,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 06:59:30,298 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-01-10 06:59:30,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:30,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-10 06:59:30,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:30,760 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 23 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:30,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:59:31,536 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 23 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:31,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174564686] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:59:31,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:59:31,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 25] total 58 [2025-01-10 06:59:31,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902442348] [2025-01-10 06:59:31,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:59:31,537 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 06:59:31,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:31,538 INFO L85 PathProgramCache]: Analyzing trace with hash 43930390, now seen corresponding path program 3 times [2025-01-10 06:59:31,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:31,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383008218] [2025-01-10 06:59:31,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:59:31,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:31,539 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:59:31,541 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:31,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:59:31,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:31,541 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:31,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:59:31,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:31,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:31,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:31,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:31,686 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:31,686 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:31,686 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:31,686 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:31,686 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 06:59:31,686 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:31,686 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:31,686 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:31,686 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration6_Loop [2025-01-10 06:59:31,686 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:31,686 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:31,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:31,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:31,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:31,768 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-01-10 06:59:32,046 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:32,046 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 06:59:32,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:32,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:32,048 INFO L229 MonitoredProcess]: Starting monitored process 49 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 06:59:32,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-01-10 06:59:32,050 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:32,050 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:32,062 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:32,062 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:32,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-01-10 06:59:32,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:32,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:32,071 INFO L229 MonitoredProcess]: Starting monitored process 50 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 06:59:32,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-01-10 06:59:32,073 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:32,073 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:32,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:32,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:32,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:32,102 INFO L229 MonitoredProcess]: Starting monitored process 51 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 06:59:32,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-01-10 06:59:32,103 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 06:59:32,104 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:32,128 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:32,128 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=-2, ULTIMATE.start_main_~a~0#1=1, ULTIMATE.start_main_~b~0#1=-3} Honda state: {ULTIMATE.start_main_~x~0#1=-2, ULTIMATE.start_main_~a~0#1=1, ULTIMATE.start_main_~b~0#1=-3} Generalized eigenvectors: [{ULTIMATE.start_main_~x~0#1=0, ULTIMATE.start_main_~a~0#1=0, ULTIMATE.start_main_~b~0#1=0}, {ULTIMATE.start_main_~x~0#1=3, ULTIMATE.start_main_~a~0#1=1, ULTIMATE.start_main_~b~0#1=0}, {ULTIMATE.start_main_~x~0#1=0, ULTIMATE.start_main_~a~0#1=0, ULTIMATE.start_main_~b~0#1=0}] Lambdas: [2, 1, 1] Nus: [0, 1] [2025-01-10 06:59:32,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-01-10 06:59:32,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:32,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:32,134 INFO L229 MonitoredProcess]: Starting monitored process 52 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 06:59:32,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-01-10 06:59:32,136 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:32,136 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:32,146 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:32,146 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~bitwise2#1=0} Honda state: {ULTIMATE.start_main_#t~bitwise2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:32,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-01-10 06:59:32,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:59:32,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-01-10 06:59:32,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=646, Invalid=2660, Unknown=0, NotChecked=0, Total=3306 [2025-01-10 06:59:32,154 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. cyclomatic complexity: 7 Second operand has 58 states, 58 states have (on average 2.0344827586206895) internal successors, (118), 58 states have internal predecessors, (118), 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 06:59:32,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:59:32,557 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2025-01-10 06:59:32,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 84 transitions. [2025-01-10 06:59:32,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 06:59:32,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 80 states and 84 transitions. [2025-01-10 06:59:32,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-01-10 06:59:32,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-01-10 06:59:32,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 84 transitions. [2025-01-10 06:59:32,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:32,559 INFO L218 hiAutomatonCegarLoop]: Abstraction has 80 states and 84 transitions. [2025-01-10 06:59:32,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 84 transitions. [2025-01-10 06:59:32,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-01-10 06:59:32,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.05) internal successors, (84), 79 states have internal predecessors, (84), 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 06:59:32,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2025-01-10 06:59:32,567 INFO L240 hiAutomatonCegarLoop]: Abstraction has 80 states and 84 transitions. [2025-01-10 06:59:32,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-10 06:59:32,570 INFO L432 stractBuchiCegarLoop]: Abstraction has 80 states and 84 transitions. [2025-01-10 06:59:32,570 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 06:59:32,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 84 transitions. [2025-01-10 06:59:32,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 06:59:32,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:32,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:32,575 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 14, 14, 13, 13, 1, 1, 1] [2025-01-10 06:59:32,575 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 06:59:32,575 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_#t~nondet0#1, main_#t~post1#1, main_#t~bitwise2#1, main_~a~0#1, main_~b~0#1, main_~x~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;main_~a~0#1 := 16;main_~b~0#1 := 30;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume 0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1;main_#t~bitwise2#1 := main_~a~0#1;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" [2025-01-10 06:59:32,576 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" [2025-01-10 06:59:32,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:32,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1984962677, now seen corresponding path program 4 times [2025-01-10 06:59:32,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:32,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021345611] [2025-01-10 06:59:32,576 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:59:32,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:32,585 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 72 statements into 2 equivalence classes. [2025-01-10 06:59:32,612 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 06:59:32,612 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:59:32,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:32,612 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:32,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-10 06:59:32,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 06:59:32,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:32,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:32,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:32,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:32,645 INFO L85 PathProgramCache]: Analyzing trace with hash 43930390, now seen corresponding path program 4 times [2025-01-10 06:59:32,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:32,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984363804] [2025-01-10 06:59:32,645 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:59:32,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:32,647 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-01-10 06:59:32,650 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:32,650 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:59:32,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:32,651 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:32,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:59:32,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:32,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:32,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:32,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:32,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:32,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1568761396, now seen corresponding path program 5 times [2025-01-10 06:59:32,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:32,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837256130] [2025-01-10 06:59:32,657 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 06:59:32,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:32,667 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 77 statements into 15 equivalence classes. [2025-01-10 06:59:32,793 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 77 of 77 statements. [2025-01-10 06:59:32,798 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-01-10 06:59:32,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:32,798 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:32,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-10 06:59:32,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-10 06:59:32,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:32,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:32,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:32,987 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:32,988 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:32,988 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:32,988 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:32,988 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 06:59:32,988 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:32,988 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:32,988 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:32,988 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration7_Loop [2025-01-10 06:59:32,988 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:32,988 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:32,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:32,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:33,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:33,102 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-01-10 06:59:33,397 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:33,397 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 06:59:33,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:33,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:33,402 INFO L229 MonitoredProcess]: Starting monitored process 53 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 06:59:33,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-01-10 06:59:33,404 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:33,404 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:33,415 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:33,415 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~bitwise2#1=0} Honda state: {ULTIMATE.start_main_#t~bitwise2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:33,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-01-10 06:59:33,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:33,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:33,422 INFO L229 MonitoredProcess]: Starting monitored process 54 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 06:59:33,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-01-10 06:59:33,424 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:33,424 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:33,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-01-10 06:59:33,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:33,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:33,460 INFO L229 MonitoredProcess]: Starting monitored process 55 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 06:59:33,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-01-10 06:59:33,463 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 06:59:33,463 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:33,487 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:33,488 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=0, ULTIMATE.start_main_~a~0#1=1, ULTIMATE.start_main_~b~0#1=-1} Honda state: {ULTIMATE.start_main_~x~0#1=0, ULTIMATE.start_main_~a~0#1=1, ULTIMATE.start_main_~b~0#1=-1} Generalized eigenvectors: [{ULTIMATE.start_main_~x~0#1=1, ULTIMATE.start_main_~a~0#1=1, ULTIMATE.start_main_~b~0#1=0}, {ULTIMATE.start_main_~x~0#1=0, ULTIMATE.start_main_~a~0#1=0, ULTIMATE.start_main_~b~0#1=0}, {ULTIMATE.start_main_~x~0#1=0, ULTIMATE.start_main_~a~0#1=0, ULTIMATE.start_main_~b~0#1=0}] Lambdas: [1, 0, 2] Nus: [0, 1] [2025-01-10 06:59:33,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-01-10 06:59:33,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:33,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:33,494 INFO L229 MonitoredProcess]: Starting monitored process 56 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 06:59:33,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-01-10 06:59:33,496 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:33,496 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:33,506 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:33,506 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:33,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-01-10 06:59:35,071 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:35,072 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:35,072 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:35,072 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:35,072 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 06:59:35,072 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:35,072 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:35,072 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:35,072 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration7_Lasso [2025-01-10 06:59:35,072 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:35,072 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:35,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:35,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:35,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:35,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:35,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:35,177 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-01-10 06:59:35,460 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:35,460 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 06:59:35,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:35,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:35,463 INFO L229 MonitoredProcess]: Starting monitored process 57 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 06:59:35,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-01-10 06:59:35,465 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:35,465 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:35,476 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:35,476 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:35,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-01-10 06:59:35,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:35,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:35,484 INFO L229 MonitoredProcess]: Starting monitored process 58 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 06:59:35,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-01-10 06:59:35,487 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:35,487 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:35,497 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:35,497 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~bitwise2#1=0} Honda state: {ULTIMATE.start_main_#t~bitwise2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:35,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-01-10 06:59:35,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:35,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:35,505 INFO L229 MonitoredProcess]: Starting monitored process 59 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 06:59:35,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-01-10 06:59:35,507 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:35,507 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:35,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-01-10 06:59:35,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:35,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:35,526 INFO L229 MonitoredProcess]: Starting monitored process 60 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 06:59:35,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-01-10 06:59:35,528 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 06:59:35,528 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:35,559 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 06:59:35,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-01-10 06:59:35,564 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:35,565 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:35,565 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:35,565 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:35,565 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 06:59:35,565 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:35,565 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:35,565 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:35,565 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration7_Lasso [2025-01-10 06:59:35,565 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:35,565 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:35,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:35,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:35,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:35,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:35,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:35,671 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-01-10 06:59:35,979 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:35,979 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 06:59:35,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:35,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:35,981 INFO L229 MonitoredProcess]: Starting monitored process 61 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 06:59:35,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-01-10 06:59:35,983 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 06:59:35,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:35,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:35,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:35,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:35,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:35,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:35,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:35,995 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:36,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-01-10 06:59:36,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:36,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:36,004 INFO L229 MonitoredProcess]: Starting monitored process 62 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 06:59:36,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-01-10 06:59:36,006 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 06:59:36,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:36,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:36,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:36,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:36,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:36,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:36,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:36,023 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:36,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-01-10 06:59:36,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:36,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:36,034 INFO L229 MonitoredProcess]: Starting monitored process 63 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 06:59:36,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-01-10 06:59:36,036 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 06:59:36,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:36,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:36,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:36,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:36,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:36,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:36,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:36,047 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:36,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:36,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:36,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:36,055 INFO L229 MonitoredProcess]: Starting monitored process 64 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 06:59:36,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-01-10 06:59:36,056 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 06:59:36,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:36,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:36,066 INFO L204 nArgumentSynthesizer]: 7 loop disjuncts [2025-01-10 06:59:36,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:36,138 INFO L401 nArgumentSynthesizer]: We have 126 Motzkin's Theorem applications. [2025-01-10 06:59:36,138 INFO L402 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2025-01-10 06:59:38,261 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 06:59:39,255 INFO L443 ModelExtractionUtils]: Simplification made 35 calls to the SMT solver. [2025-01-10 06:59:39,255 INFO L444 ModelExtractionUtils]: 23 out of 61 variables were initially zero. Simplification set additionally 23 variables to zero. [2025-01-10 06:59:39,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:39,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:39,257 INFO L229 MonitoredProcess]: Starting monitored process 65 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 06:59:39,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-01-10 06:59:39,259 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 06:59:39,282 INFO L438 nArgumentSynthesizer]: Removed 11 redundant supporting invariants from a total of 14. [2025-01-10 06:59:39,283 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 06:59:39,283 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = 2*ULTIMATE.start_main_~x~0#1 + 1 Supporting invariants [1*ULTIMATE.start_main_~x~0#1 >= 0, -5*ULTIMATE.start_main_~a~0#1 + 5*ULTIMATE.start_main_~b~0#1 + 6 >= 0, 1*ULTIMATE.start_main_~a~0#1 >= 0] [2025-01-10 06:59:39,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-01-10 06:59:39,307 INFO L156 tatePredicateManager]: 1 out of 3 supporting invariants were superfluous and have been removed [2025-01-10 06:59:39,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:39,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-10 06:59:39,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 06:59:39,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:39,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:39,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 06:59:39,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:39,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:59:39,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:39,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:39,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:39,840 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 06:59:39,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:39,948 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 06:59:39,949 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.19 stem predicates 5 loop predicates [2025-01-10 06:59:39,949 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 84 transitions. cyclomatic complexity: 7 Second operand has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 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 06:59:39,979 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 84 transitions. cyclomatic complexity: 7. Second operand has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 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 80 states and 84 transitions. Complement of second has 5 states. [2025-01-10 06:59:39,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:39,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 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 06:59:39,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2025-01-10 06:59:39,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 4 transitions. Stem has 72 letters. Loop has 5 letters. [2025-01-10 06:59:39,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:39,980 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 06:59:39,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:40,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-10 06:59:40,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 06:59:40,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:40,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:40,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 06:59:40,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:40,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:40,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:59:40,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:40,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:40,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:40,447 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 06:59:40,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:40,555 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 06:59:40,556 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.19 stem predicates 5 loop predicates [2025-01-10 06:59:40,556 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 84 transitions. cyclomatic complexity: 7 Second operand has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 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 06:59:40,591 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 84 transitions. cyclomatic complexity: 7. Second operand has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 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 80 states and 84 transitions. Complement of second has 5 states. [2025-01-10 06:59:40,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:40,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 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 06:59:40,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2025-01-10 06:59:40,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 4 transitions. Stem has 72 letters. Loop has 5 letters. [2025-01-10 06:59:40,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:40,593 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 06:59:40,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:40,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-10 06:59:40,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 06:59:40,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:40,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:40,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 06:59:40,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:41,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:59:41,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:41,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:41,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:41,107 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 06:59:41,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:41,220 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 06:59:41,220 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.19 stem predicates 5 loop predicates [2025-01-10 06:59:41,221 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 84 transitions. cyclomatic complexity: 7 Second operand has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 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 06:59:41,794 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 84 transitions. cyclomatic complexity: 7. Second operand has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 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 94 states and 100 transitions. Complement of second has 42 states. [2025-01-10 06:59:41,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 25 states 19 stem states 4 non-accepting loop states 2 accepting loop states [2025-01-10 06:59:41,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 states have internal predecessors, (77), 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 06:59:41,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 101 transitions. [2025-01-10 06:59:41,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 101 transitions. Stem has 72 letters. Loop has 5 letters. [2025-01-10 06:59:41,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:41,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 101 transitions. Stem has 77 letters. Loop has 5 letters. [2025-01-10 06:59:41,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:41,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 101 transitions. Stem has 72 letters. Loop has 10 letters. [2025-01-10 06:59:41,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:41,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 100 transitions. [2025-01-10 06:59:41,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-01-10 06:59:41,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 89 states and 94 transitions. [2025-01-10 06:59:41,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-01-10 06:59:41,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-01-10 06:59:41,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 94 transitions. [2025-01-10 06:59:41,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:41,805 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 94 transitions. [2025-01-10 06:59:41,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 94 transitions. [2025-01-10 06:59:41,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2025-01-10 06:59:41,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 83 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:41,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2025-01-10 06:59:41,811 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84 states and 89 transitions. [2025-01-10 06:59:41,811 INFO L432 stractBuchiCegarLoop]: Abstraction has 84 states and 89 transitions. [2025-01-10 06:59:41,811 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-01-10 06:59:41,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 89 transitions. [2025-01-10 06:59:41,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-01-10 06:59:41,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:41,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:41,813 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 14, 14, 13, 13, 1, 1, 1] [2025-01-10 06:59:41,815 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2025-01-10 06:59:41,816 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_#t~nondet0#1, main_#t~post1#1, main_#t~bitwise2#1, main_~a~0#1, main_~b~0#1, main_~x~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;main_~a~0#1 := 16;main_~b~0#1 := 30;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume 0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1;main_#t~bitwise2#1 := main_~a~0#1;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" [2025-01-10 06:59:41,816 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume 0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1;main_#t~bitwise2#1 := main_~a~0#1;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" [2025-01-10 06:59:41,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:41,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1984962677, now seen corresponding path program 6 times [2025-01-10 06:59:41,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:41,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639186077] [2025-01-10 06:59:41,817 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 06:59:41,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:41,825 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 72 statements into 15 equivalence classes. [2025-01-10 06:59:41,874 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 06:59:41,874 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2025-01-10 06:59:41,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:41,874 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:41,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-10 06:59:41,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 06:59:41,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:41,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:41,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:41,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:41,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1234817916, now seen corresponding path program 1 times [2025-01-10 06:59:41,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:41,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591596580] [2025-01-10 06:59:41,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:41,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:41,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:59:41,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:59:41,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:41,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:41,917 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:41,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:59:41,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:59:41,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:41,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:41,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:41,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:41,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1431641586, now seen corresponding path program 7 times [2025-01-10 06:59:41,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:41,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794902224] [2025-01-10 06:59:41,923 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 06:59:41,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:41,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-10 06:59:41,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-10 06:59:41,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:41,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:41,941 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:41,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-10 06:59:41,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-10 06:59:41,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:41,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:41,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:42,177 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:42,178 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:42,178 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:42,178 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:42,178 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 06:59:42,178 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:42,178 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:42,178 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:42,178 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration8_Loop [2025-01-10 06:59:42,178 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:42,178 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:42,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:42,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:42,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:42,377 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:42,377 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 06:59:42,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:42,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:42,379 INFO L229 MonitoredProcess]: Starting monitored process 66 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 06:59:42,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-01-10 06:59:42,380 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:42,380 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:42,391 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:42,391 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:42,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-01-10 06:59:42,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:42,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:42,399 INFO L229 MonitoredProcess]: Starting monitored process 67 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 06:59:42,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-01-10 06:59:42,401 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:42,401 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:42,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-01-10 06:59:42,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:42,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:42,421 INFO L229 MonitoredProcess]: Starting monitored process 68 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 06:59:42,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-01-10 06:59:42,423 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 06:59:42,423 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:42,445 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 06:59:42,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:42,449 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:42,449 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:42,449 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:42,449 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:42,449 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 06:59:42,449 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:42,449 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:42,449 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:42,449 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration8_Loop [2025-01-10 06:59:42,449 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:42,449 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:42,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:42,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:42,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:42,625 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:42,626 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 06:59:42,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:42,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:42,628 INFO L229 MonitoredProcess]: Starting monitored process 69 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 06:59:42,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-01-10 06:59:42,630 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 06:59:42,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:42,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:42,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:42,640 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-01-10 06:59:42,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:42,643 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:42,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:42,648 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 06:59:42,651 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 06:59:42,651 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 06:59:42,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:42,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:42,653 INFO L229 MonitoredProcess]: Starting monitored process 70 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 06:59:42,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-01-10 06:59:42,655 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 06:59:42,655 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 06:59:42,655 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 06:59:42,655 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~a~0#1) = -1*ULTIMATE.start_main_~a~0#1 + 2147483647 Supporting invariants [] [2025-01-10 06:59:42,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-01-10 06:59:42,661 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 06:59:42,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:42,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-10 06:59:42,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 06:59:42,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:42,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:42,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:42,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:42,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:59:42,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:59:42,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:42,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:42,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 06:59:42,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:42,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:42,987 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-01-10 06:59:42,987 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 89 transitions. cyclomatic complexity: 8 Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 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 06:59:43,057 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 89 transitions. cyclomatic complexity: 8. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 168 states and 179 transitions. Complement of second has 10 states. [2025-01-10 06:59:43,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:43,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 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 06:59:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2025-01-10 06:59:43,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 72 letters. Loop has 8 letters. [2025-01-10 06:59:43,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:43,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 80 letters. Loop has 8 letters. [2025-01-10 06:59:43,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:43,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 72 letters. Loop has 16 letters. [2025-01-10 06:59:43,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:43,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 179 transitions. [2025-01-10 06:59:43,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 06:59:43,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 90 states and 96 transitions. [2025-01-10 06:59:43,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-01-10 06:59:43,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-01-10 06:59:43,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 96 transitions. [2025-01-10 06:59:43,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:43,067 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 96 transitions. [2025-01-10 06:59:43,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 96 transitions. [2025-01-10 06:59:43,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2025-01-10 06:59:43,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.058139534883721) internal successors, (91), 85 states have internal predecessors, (91), 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 06:59:43,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2025-01-10 06:59:43,072 INFO L240 hiAutomatonCegarLoop]: Abstraction has 86 states and 91 transitions. [2025-01-10 06:59:43,072 INFO L432 stractBuchiCegarLoop]: Abstraction has 86 states and 91 transitions. [2025-01-10 06:59:43,073 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-01-10 06:59:43,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 91 transitions. [2025-01-10 06:59:43,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 06:59:43,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:43,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:43,075 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 14, 14, 14, 2, 1, 1] [2025-01-10 06:59:43,075 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 06:59:43,075 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_#t~nondet0#1, main_#t~post1#1, main_#t~bitwise2#1, main_~a~0#1, main_~b~0#1, main_~x~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;main_~a~0#1 := 16;main_~b~0#1 := 30;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume 0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1;main_#t~bitwise2#1 := main_~a~0#1;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume 0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1;main_#t~bitwise2#1 := main_~a~0#1;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" [2025-01-10 06:59:43,075 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume 0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1;main_#t~bitwise2#1 := main_~a~0#1;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" [2025-01-10 06:59:43,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:43,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1386963063, now seen corresponding path program 8 times [2025-01-10 06:59:43,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:43,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562349497] [2025-01-10 06:59:43,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:59:43,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:43,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-01-10 06:59:43,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-01-10 06:59:43,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:59:43,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:43,094 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:43,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-10 06:59:43,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-10 06:59:43,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:43,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:43,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:43,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:43,112 INFO L85 PathProgramCache]: Analyzing trace with hash 35855, now seen corresponding path program 4 times [2025-01-10 06:59:43,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:43,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218081158] [2025-01-10 06:59:43,112 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:59:43,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:43,114 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-01-10 06:59:43,114 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:43,114 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:59:43,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:43,114 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:43,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:43,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:43,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:43,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:43,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:43,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:43,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1431216249, now seen corresponding path program 9 times [2025-01-10 06:59:43,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:43,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761527123] [2025-01-10 06:59:43,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:59:43,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:43,134 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 81 statements into 16 equivalence classes. [2025-01-10 06:59:43,141 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 13 of 81 statements. [2025-01-10 06:59:43,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 06:59:43,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:43,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-01-10 06:59:43,219 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2025-01-10 06:59:43,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:59:43,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761527123] [2025-01-10 06:59:43,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761527123] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:59:43,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:59:43,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:59:43,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282747211] [2025-01-10 06:59:43,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:59:43,253 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:43,253 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:43,253 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:43,253 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:43,253 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 06:59:43,254 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:43,254 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:43,254 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:43,254 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration9_Loop [2025-01-10 06:59:43,254 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:43,254 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:43,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:43,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:43,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:43,332 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:43,332 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 06:59:43,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:43,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:43,335 INFO L229 MonitoredProcess]: Starting monitored process 71 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 06:59:43,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-01-10 06:59:43,338 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:43,338 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:43,352 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:43,352 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~bitwise2#1=0} Honda state: {ULTIMATE.start_main_#t~bitwise2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:43,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:43,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:43,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:43,362 INFO L229 MonitoredProcess]: Starting monitored process 72 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 06:59:43,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-01-10 06:59:43,365 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:43,365 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:43,380 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:43,380 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:43,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:43,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:43,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:43,390 INFO L229 MonitoredProcess]: Starting monitored process 73 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 06:59:43,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-01-10 06:59:43,394 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:43,394 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:43,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:43,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:43,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:43,430 INFO L229 MonitoredProcess]: Starting monitored process 74 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 06:59:43,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-01-10 06:59:43,433 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 06:59:43,434 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:43,720 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 06:59:43,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-01-10 06:59:43,730 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:43,730 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:43,730 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:43,730 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:43,730 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 06:59:43,730 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:43,730 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:43,730 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:43,730 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration9_Loop [2025-01-10 06:59:43,730 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:43,730 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:43,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:43,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:43,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:43,803 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:43,803 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 06:59:43,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:43,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:43,806 INFO L229 MonitoredProcess]: Starting monitored process 75 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 06:59:43,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-01-10 06:59:43,819 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 06:59:43,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:43,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:43,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:43,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:43,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:43,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:43,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:43,848 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:43,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-01-10 06:59:43,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:43,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:43,876 INFO L229 MonitoredProcess]: Starting monitored process 76 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 06:59:43,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-01-10 06:59:43,879 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 06:59:43,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:43,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:43,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:43,893 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-01-10 06:59:43,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:43,895 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 06:59:43,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:43,900 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:43,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:43,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:43,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:43,911 INFO L229 MonitoredProcess]: Starting monitored process 77 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 06:59:43,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-01-10 06:59:43,915 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 06:59:43,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:43,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:43,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:43,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:43,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:43,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:43,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:43,932 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:43,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-01-10 06:59:43,940 INFO L451 LassoAnalysis]: Using template '2-nested'. [2025-01-10 06:59:43,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:43,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:43,943 INFO L229 MonitoredProcess]: Starting monitored process 78 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 06:59:43,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-01-10 06:59:43,946 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 06:59:43,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:43,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:43,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:43,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:43,960 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 06:59:43,960 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 06:59:43,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:43,962 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:43,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-01-10 06:59:43,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:43,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:43,973 INFO L229 MonitoredProcess]: Starting monitored process 79 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 06:59:43,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-01-10 06:59:43,976 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 06:59:43,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:43,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:43,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:43,990 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-01-10 06:59:43,990 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 06:59:43,992 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:43,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:43,998 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 06:59:44,005 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-01-10 06:59:44,006 INFO L444 ModelExtractionUtils]: 5 out of 9 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 06:59:44,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:44,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:44,008 INFO L229 MonitoredProcess]: Starting monitored process 80 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 06:59:44,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-01-10 06:59:44,011 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 06:59:44,012 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 06:59:44,012 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 06:59:44,012 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = -1*ULTIMATE.start_main_~a~0#1 f1 = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2025-01-10 06:59:44,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:44,021 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 06:59:44,023 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression [2025-01-10 06:59:44,023 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression [2025-01-10 06:59:44,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:44,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-10 06:59:44,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-10 06:59:44,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:44,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:44,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:44,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:44,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:44,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:44,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:44,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:44,165 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 06:59:44,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:44,257 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 06:59:44,257 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-01-10 06:59:44,258 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 91 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 06:59:44,335 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 91 transitions. cyclomatic complexity: 9. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 90 states and 95 transitions. Complement of second has 7 states. [2025-01-10 06:59:44,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:44,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 06:59:44,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2025-01-10 06:59:44,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 78 letters. Loop has 3 letters. [2025-01-10 06:59:44,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:44,340 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 06:59:44,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:44,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-10 06:59:44,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-10 06:59:44,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:44,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:44,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:44,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:44,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:44,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:44,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:44,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:44,456 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 06:59:44,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:44,528 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 06:59:44,528 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2025-01-10 06:59:44,528 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 91 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 06:59:44,546 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 91 transitions. cyclomatic complexity: 9. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 90 states and 95 transitions. Complement of second has 5 states. [2025-01-10 06:59:44,547 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 06:59:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 06:59:44,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2025-01-10 06:59:44,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 78 letters. Loop has 3 letters. [2025-01-10 06:59:44,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:44,548 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 06:59:44,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:44,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-10 06:59:44,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-10 06:59:44,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:44,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:44,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:44,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:44,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:44,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:44,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:44,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:44,689 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 06:59:44,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:44,771 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 06:59:44,772 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-01-10 06:59:44,772 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 91 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 06:59:44,848 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 91 transitions. cyclomatic complexity: 9. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 148 states and 158 transitions. Complement of second has 8 states. [2025-01-10 06:59:44,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:44,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 06:59:44,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2025-01-10 06:59:44,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 78 letters. Loop has 3 letters. [2025-01-10 06:59:44,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:44,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 81 letters. Loop has 3 letters. [2025-01-10 06:59:44,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:44,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 78 letters. Loop has 6 letters. [2025-01-10 06:59:44,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:44,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 158 transitions. [2025-01-10 06:59:44,852 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 06:59:44,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 0 states and 0 transitions. [2025-01-10 06:59:44,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-01-10 06:59:44,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-01-10 06:59:44,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-01-10 06:59:44,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 06:59:44,852 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 06:59:44,852 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 06:59:44,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:59:44,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:59:44,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:59:44,853 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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 06:59:44,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:59:44,853 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-01-10 06:59:44,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-01-10 06:59:44,853 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 06:59:44,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 06:59:44,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-01-10 06:59:44,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-01-10 06:59:44,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-01-10 06:59:44,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 06:59:44,853 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 06:59:44,853 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 06:59:44,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 06:59:44,853 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 06:59:44,853 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-01-10 06:59:44,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-01-10 06:59:44,853 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 06:59:44,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-01-10 06:59:44,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 06:59:44 BoogieIcfgContainer [2025-01-10 06:59:44,861 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 06:59:44,862 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:59:44,862 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:59:44,862 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:59:44,862 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:59:19" (3/4) ... [2025-01-10 06:59:44,864 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 06:59:44,865 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:59:44,866 INFO L158 Benchmark]: Toolchain (without parser) took 26244.13ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 112.0MB in the beginning and 105.3MB in the end (delta: 6.7MB). Peak memory consumption was 157.7MB. Max. memory is 16.1GB. [2025-01-10 06:59:44,866 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:59:44,867 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.68ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 102.1MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:59:44,867 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.51ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 101.1MB in the end (delta: 945.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:59:44,867 INFO L158 Benchmark]: Boogie Preprocessor took 27.25ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 100.2MB in the end (delta: 974.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:59:44,867 INFO L158 Benchmark]: RCFGBuilder took 205.01ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 90.3MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:59:44,868 INFO L158 Benchmark]: BuchiAutomizer took 25805.31ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 90.3MB in the beginning and 105.4MB in the end (delta: -15.1MB). Peak memory consumption was 140.9MB. Max. memory is 16.1GB. [2025-01-10 06:59:44,868 INFO L158 Benchmark]: Witness Printer took 3.81ms. Allocated memory is still 293.6MB. Free memory was 105.4MB in the beginning and 105.3MB in the end (delta: 60.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:59:44,869 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 173.68ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 102.1MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.51ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 101.1MB in the end (delta: 945.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.25ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 100.2MB in the end (delta: 974.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 205.01ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 90.3MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 25805.31ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 90.3MB in the beginning and 105.4MB in the end (delta: -15.1MB). Peak memory consumption was 140.9MB. Max. memory is 16.1GB. * Witness Printer took 3.81ms. Allocated memory is still 293.6MB. Free memory was 105.4MB in the beginning and 105.3MB in the end (delta: 60.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (6 trivial, 5 deterministic, 2 nondeterministic). One deterministic module has 2-nested ranking function null, null and consists of 5 locations. One deterministic module has 2-nested ranking function null, null and consists of 4 locations. One deterministic module has affine ranking function (4294967295 + ((long) -2 * a)) and consists of 8 locations. One deterministic module has 2-nested ranking function null, null and consists of 4 locations. One deterministic module has affine ranking function (2147483647 + ((long) -1 * a)) and consists of 6 locations. One nondeterministic module has affine ranking function (((long) 2 * x) + 1) and consists of 25 locations. One nondeterministic module has 2-nested ranking function null, null and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 58 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 25.7s and 10 iterations. TraceHistogramMax:16. Analysis of lassos took 20.0s. Construction of modules took 0.8s. Büchi inclusion checks took 4.7s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 21 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 [5, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/3 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 328 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 321 mSDsluCounter, 147 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 214 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1398 IncrementalHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 214 mSolverCounterUnsat, 85 mSDtfsCounter, 1398 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT2 SILN2 SILU0 SILI0 SILT2 lasso2 LassoPreprocessingBenchmarks: Lassos: inital57 mio100 ax100 hnf100 lsp107 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq156 hnf95 smp100 dnf948 smp53 tf101 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 1899ms VariablesStem: 3 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 7 SupportingInvariants: 14 MotzkinApplications: 126 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 17 LassoNonterminationAnalysisSatUnbounded: 4 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.8s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-01-10 06:59:44,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-01-10 06:59:45,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:45,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:45,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:45,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE