./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-bwb/or-04.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-bwb/or-04.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 c5de9087a921e8aad95bc80b29f24bf9506596da18bf9b4640846346a82bb2ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:17:33,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:17:33,345 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-08 14:17:33,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:17:33,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:17:33,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:17:33,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:17:33,374 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:17:33,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:17:33,374 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:17:33,374 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:17:33,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:17:33,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:17:33,375 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:17:33,375 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:17:33,375 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:17:33,375 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:17:33,375 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:17:33,375 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:17:33,375 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:17:33,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:17:33,375 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:17:33,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:17:33,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:17:33,376 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:17:33,376 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:17:33,376 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:17:33,376 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:17:33,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:17:33,376 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:17:33,376 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:17:33,376 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:17:33,376 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:17:33,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:17:33,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:17:33,376 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:17:33,376 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:17:33,376 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 -> c5de9087a921e8aad95bc80b29f24bf9506596da18bf9b4640846346a82bb2ae [2025-02-08 14:17:33,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:17:33,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:17:33,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:17:33,613 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:17:33,614 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:17:33,614 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-bwb/or-04.c [2025-02-08 14:17:34,741 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0a5952a8/90a31ad4ff0f47e68477066d17b4a233/FLAGb2769b5c2 [2025-02-08 14:17:34,980 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:17:34,982 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-bwb/or-04.c [2025-02-08 14:17:34,986 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0a5952a8/90a31ad4ff0f47e68477066d17b4a233/FLAGb2769b5c2 [2025-02-08 14:17:35,000 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0a5952a8/90a31ad4ff0f47e68477066d17b4a233 [2025-02-08 14:17:35,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:17:35,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:17:35,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:17:35,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:17:35,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:17:35,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:17:35" (1/1) ... [2025-02-08 14:17:35,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b1d79a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:35, skipping insertion in model container [2025-02-08 14:17:35,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:17:35" (1/1) ... [2025-02-08 14:17:35,051 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:17:35,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:17:35,171 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:17:35,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:17:35,186 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:17:35,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:35 WrapperNode [2025-02-08 14:17:35,186 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:17:35,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:17:35,187 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:17:35,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:17:35,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:35" (1/1) ... [2025-02-08 14:17:35,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:35" (1/1) ... [2025-02-08 14:17:35,202 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 27 [2025-02-08 14:17:35,203 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:17:35,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:17:35,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:17:35,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:17:35,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:35" (1/1) ... [2025-02-08 14:17:35,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:35" (1/1) ... [2025-02-08 14:17:35,209 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:35" (1/1) ... [2025-02-08 14:17:35,213 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-08 14:17:35,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:35" (1/1) ... [2025-02-08 14:17:35,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:35" (1/1) ... [2025-02-08 14:17:35,216 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:35" (1/1) ... [2025-02-08 14:17:35,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:35" (1/1) ... [2025-02-08 14:17:35,217 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:35" (1/1) ... [2025-02-08 14:17:35,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:35" (1/1) ... [2025-02-08 14:17:35,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:17:35,218 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:17:35,218 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:17:35,218 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:17:35,219 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:35" (1/1) ... [2025-02-08 14:17:35,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:35,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:35,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:35,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-08 14:17:35,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:17:35,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:17:35,300 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:17:35,301 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:17:35,363 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-02-08 14:17:35,365 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:17:35,382 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:17:35,383 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:17:35,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:17:35 BoogieIcfgContainer [2025-02-08 14:17:35,383 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:17:35,384 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:17:35,384 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:17:35,387 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:17:35,388 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:17:35,388 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:17:35" (1/3) ... [2025-02-08 14:17:35,389 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73c6b119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:17:35, skipping insertion in model container [2025-02-08 14:17:35,389 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:17:35,389 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:35" (2/3) ... [2025-02-08 14:17:35,389 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73c6b119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:17:35, skipping insertion in model container [2025-02-08 14:17:35,389 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:17:35,389 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:17:35" (3/3) ... [2025-02-08 14:17:35,390 INFO L363 chiAutomizerObserver]: Analyzing ICFG or-04.c [2025-02-08 14:17:35,429 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:17:35,429 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:17:35,429 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:17:35,429 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:17:35,430 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:17:35,430 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:17:35,430 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:17:35,430 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:17:35,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:17:35,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-08 14:17:35,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:17:35,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:17:35,446 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:17:35,447 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:17:35,447 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:17:35,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:17:35,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-08 14:17:35,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:17:35,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:17:35,449 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:17:35,449 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:17:35,453 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~nondet1#1, main_#t~bitwise2#1, main_~y~0#1, main_~x~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-02-08 14:17:35,453 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x~0#1 >= main_~y~0#1 && main_~y~0#1 > 0;" "assume !(0 != main_~y~0#1);" [2025-02-08 14:17:35,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:35,457 INFO L85 PathProgramCache]: Analyzing trace with hash 44, now seen corresponding path program 1 times [2025-02-08 14:17:35,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:35,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833723493] [2025-02-08 14:17:35,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:35,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:35,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:17:35,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:17:35,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:35,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:35,509 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:35,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:17:35,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:17:35,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:35,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:35,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:35,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:35,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 1 times [2025-02-08 14:17:35,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:35,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868659899] [2025-02-08 14:17:35,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:35,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:35,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:17:35,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:17:35,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:35,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:35,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:17:35,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:17:35,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868659899] [2025-02-08 14:17:35,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868659899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:17:35,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:17:35,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:17:35,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476666422] [2025-02-08 14:17:35,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:17:35,590 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:17:35,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:17:35,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:17:35,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:17:35,611 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:17:35,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:17:35,643 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2025-02-08 14:17:35,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2025-02-08 14:17:35,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-02-08 14:17:35,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 10 states and 12 transitions. [2025-02-08 14:17:35,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-08 14:17:35,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-08 14:17:35,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2025-02-08 14:17:35,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:17:35,649 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2025-02-08 14:17:35,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2025-02-08 14:17:35,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-02-08 14:17:35,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) 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-02-08 14:17:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2025-02-08 14:17:35,666 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2025-02-08 14:17:35,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:17:35,669 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2025-02-08 14:17:35,670 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:17:35,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2025-02-08 14:17:35,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-02-08 14:17:35,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:17:35,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:17:35,671 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:17:35,671 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:17:35,671 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~nondet1#1, main_#t~bitwise2#1, main_~y~0#1, main_~x~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-02-08 14:17:35,671 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x~0#1 >= main_~y~0#1 && main_~y~0#1 > 0;" "assume 0 != main_~y~0#1;" "assume main_~y~0#1 > 0;" "assume !(0 == main_~y~0#1 || main_~y~0#1 == 1 + main_~y~0#1);" "assume !(0 == 1 + main_~y~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~y~0#1 < 0 && 1 + main_~y~0#1 >= 0) || main_#t~bitwise2#1 >= 1 + main_~y~0#1) && ((main_~y~0#1 >= 0 && 1 + main_~y~0#1 < 0) || main_#t~bitwise2#1 >= main_~y~0#1)) && ((main_~y~0#1 < 0 || 1 + main_~y~0#1 < 0) || main_#t~bitwise2#1 <= main_~y~0#1 + (1 + main_~y~0#1))) && ((main_~y~0#1 >= 0 && 1 + main_~y~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~y~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~y~0#1 := main_~x~0#1 - main_~y~0#1;" "assume !(0 != main_~y~0#1);" [2025-02-08 14:17:35,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:35,672 INFO L85 PathProgramCache]: Analyzing trace with hash 44, now seen corresponding path program 2 times [2025-02-08 14:17:35,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:35,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342266453] [2025-02-08 14:17:35,673 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:17:35,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:35,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:17:35,676 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:17:35,676 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:17:35,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:35,676 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:35,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:17:35,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:17:35,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:35,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:35,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:35,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:35,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1819144496, now seen corresponding path program 1 times [2025-02-08 14:17:35,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:35,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729225392] [2025-02-08 14:17:35,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:35,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:35,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:17:35,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:17:35,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:35,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:35,696 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:35,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:17:35,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:17:35,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:35,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:35,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:35,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:35,704 INFO L85 PathProgramCache]: Analyzing trace with hash 2064692219, now seen corresponding path program 1 times [2025-02-08 14:17:35,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:35,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494809576] [2025-02-08 14:17:35,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:35,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:35,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:17:35,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:17:35,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:35,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:35,710 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:35,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:17:35,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:17:35,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:35,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:35,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:35,818 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:17:35,819 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:17:35,819 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:17:35,819 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:17:35,819 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:17:35,819 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:35,819 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:17:35,819 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:17:35,820 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-04.c_Iteration2_Loop [2025-02-08 14:17:35,820 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:17:35,820 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:17:35,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:35,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:35,868 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:17:35,869 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:17:35,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:35,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:35,878 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-02-08 14:17:35,879 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-02-08 14:17:35,881 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:17:35,881 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:17:35,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:35,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:35,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:35,913 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-02-08 14:17:35,915 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-02-08 14:17:35,915 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:17:35,915 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:17:35,947 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:17:35,951 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-02-08 14:17:35,951 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:17:35,952 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:17:35,952 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:17:35,952 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:17:35,952 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:17:35,952 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:35,952 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:17:35,952 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:17:35,952 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-04.c_Iteration2_Loop [2025-02-08 14:17:35,952 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:17:35,953 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:17:35,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:35,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:36,004 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:17:36,007 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:17:36,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:36,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:36,010 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:36,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-08 14:17:36,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:17:36,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:36,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:17:36,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:36,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:36,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:36,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:17:36,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:17:36,044 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:36,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-08 14:17:36,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:36,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:36,059 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:36,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-08 14:17:36,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:17:36,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:36,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:17:36,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:36,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:36,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:36,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:17:36,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:17:36,082 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:17:36,090 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-02-08 14:17:36,092 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:17:36,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:36,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:36,099 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:36,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-08 14:17:36,101 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:17:36,101 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:17:36,102 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:17:36,102 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1) = 1*ULTIMATE.start_main_~y~0#1 Supporting invariants [] [2025-02-08 14:17:36,107 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-02-08 14:17:36,110 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:17:36,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:36,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:17:36,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:17:36,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:36,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:36,147 WARN L254 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:17:36,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:17:36,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:17:36,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:17:36,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:36,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:36,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:17:36,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:17:36,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:17:36,207 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-08 14:17:36,211 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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-02-08 14:17:36,299 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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 29 states and 37 transitions. Complement of second has 6 states. [2025-02-08 14:17:36,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-08 14:17:36,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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-02-08 14:17:36,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2025-02-08 14:17:36,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 1 letters. Loop has 8 letters. [2025-02-08 14:17:36,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:36,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 9 letters. Loop has 8 letters. [2025-02-08 14:17:36,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:36,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 1 letters. Loop has 16 letters. [2025-02-08 14:17:36,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:36,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2025-02-08 14:17:36,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2025-02-08 14:17:36,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2025-02-08 14:17:36,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-02-08 14:17:36,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-02-08 14:17:36,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2025-02-08 14:17:36,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:17:36,318 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2025-02-08 14:17:36,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2025-02-08 14:17:36,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2025-02-08 14:17:36,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:17:36,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2025-02-08 14:17:36,323 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-02-08 14:17:36,323 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-02-08 14:17:36,324 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:17:36,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2025-02-08 14:17:36,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-08 14:17:36,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:17:36,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:17:36,324 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-08 14:17:36,324 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:17:36,324 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~nondet1#1, main_#t~bitwise2#1, main_~y~0#1, main_~x~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume main_~x~0#1 >= main_~y~0#1 && main_~y~0#1 > 0;" "assume 0 != main_~y~0#1;" "assume main_~y~0#1 > 0;" [2025-02-08 14:17:36,324 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_~y~0#1 || main_~y~0#1 == 1 + main_~y~0#1);" "assume !(0 == 1 + main_~y~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~y~0#1 < 0 && 1 + main_~y~0#1 >= 0) || main_#t~bitwise2#1 >= 1 + main_~y~0#1) && ((main_~y~0#1 >= 0 && 1 + main_~y~0#1 < 0) || main_#t~bitwise2#1 >= main_~y~0#1)) && ((main_~y~0#1 < 0 || 1 + main_~y~0#1 < 0) || main_#t~bitwise2#1 <= main_~y~0#1 + (1 + main_~y~0#1))) && ((main_~y~0#1 >= 0 && 1 + main_~y~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~y~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~y~0#1 := main_~x~0#1 - main_~y~0#1;" "assume 0 != main_~y~0#1;" "assume main_~y~0#1 > 0;" [2025-02-08 14:17:36,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:36,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1322655, now seen corresponding path program 1 times [2025-02-08 14:17:36,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:36,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761623852] [2025-02-08 14:17:36,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:36,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:36,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:17:36,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:17:36,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:36,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:36,333 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:36,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:17:36,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:17:36,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:36,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:36,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:36,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:36,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1093897009, now seen corresponding path program 1 times [2025-02-08 14:17:36,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:36,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857171491] [2025-02-08 14:17:36,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:36,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:36,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:17:36,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:17:36,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:36,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:36,343 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:36,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:17:36,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:17:36,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:36,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:36,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:36,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:36,347 INFO L85 PathProgramCache]: Analyzing trace with hash -419050673, now seen corresponding path program 1 times [2025-02-08 14:17:36,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:36,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649793045] [2025-02-08 14:17:36,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:36,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:36,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:17:36,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:17:36,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:36,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:36,352 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:36,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:17:36,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:17:36,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:36,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:36,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:36,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:17:36,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:17:36,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:36,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:36,502 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:36,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:17:36,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:17:36,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:36,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:36,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:17:36 BoogieIcfgContainer [2025-02-08 14:17:36,511 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:17:36,511 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:17:36,511 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:17:36,512 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:17:36,512 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:17:35" (3/4) ... [2025-02-08 14:17:36,513 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 14:17:36,514 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:17:36,514 INFO L158 Benchmark]: Toolchain (without parser) took 1509.92ms. Allocated memory was 570.4MB in the beginning and 167.8MB in the end (delta: -402.7MB). Free memory was 525.4MB in the beginning and 38.5MB in the end (delta: 486.9MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-02-08 14:17:36,515 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:17:36,515 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.82ms. Allocated memory was 570.4MB in the beginning and 167.8MB in the end (delta: -402.7MB). Free memory was 525.4MB in the beginning and 112.9MB in the end (delta: 412.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:17:36,515 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.22ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 112.3MB in the end (delta: 686.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:17:36,515 INFO L158 Benchmark]: Boogie Preprocessor took 13.93ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 110.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:17:36,516 INFO L158 Benchmark]: IcfgBuilder took 165.02ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 100.6MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:17:36,516 INFO L158 Benchmark]: BuchiAutomizer took 1127.08ms. Allocated memory is still 167.8MB. Free memory was 100.6MB in the beginning and 39.2MB in the end (delta: 61.5MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-08 14:17:36,516 INFO L158 Benchmark]: Witness Printer took 2.50ms. Allocated memory is still 167.8MB. Free memory was 39.2MB in the beginning and 38.5MB in the end (delta: 687.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:17:36,517 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 179.82ms. Allocated memory was 570.4MB in the beginning and 167.8MB in the end (delta: -402.7MB). Free memory was 525.4MB in the beginning and 112.9MB in the end (delta: 412.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.22ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 112.3MB in the end (delta: 686.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.93ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 110.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 165.02ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 100.6MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 1127.08ms. Allocated memory is still 167.8MB. Free memory was 100.6MB in the beginning and 39.2MB in the end (delta: 61.5MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Witness Printer took 2.50ms. Allocated memory is still 167.8MB. Free memory was 39.2MB in the beginning and 38.5MB in the end (delta: 687.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function y and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 11 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq117 hnf96 smp100 dnf100 smp100 tf107 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Unable to decide termination Buchi Automizer cannot decide termination for the following lasso because it contains the following overapproximations. Overapproximations C: y|(y+1) [22] (Reason bitwiseOr) Lasso 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~nondet1#1, main_#t~bitwise2#1, main_~y~0#1, main_~x~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume main_~x~0#1 >= main_~y~0#1 && main_~y~0#1 > 0;" "assume 0 != main_~y~0#1;" "assume main_~y~0#1 > 0;" Loop: "assume !(0 == main_~y~0#1 || main_~y~0#1 == 1 + main_~y~0#1);" "assume !(0 == 1 + main_~y~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~y~0#1 < 0 && 1 + main_~y~0#1 >= 0) || main_#t~bitwise2#1 >= 1 + main_~y~0#1) && ((main_~y~0#1 >= 0 && 1 + main_~y~0#1 < 0) || main_#t~bitwise2#1 >= main_~y~0#1)) && ((main_~y~0#1 < 0 || 1 + main_~y~0#1 < 0) || main_#t~bitwise2#1 <= main_~y~0#1 + (1 + main_~y~0#1))) && ((main_~y~0#1 >= 0 && 1 + main_~y~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~y~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~y~0#1 := main_~x~0#1 - main_~y~0#1;" "assume 0 != main_~y~0#1;" "assume main_~y~0#1 > 0;" RESULT: Ultimate could not prove your program: unable to determine termination [2025-02-08 14:17:36,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-08 14:17:36,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN