./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-bwb/and-03.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/and-03.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 86d52fe8166d050ac731ccea951d586d64260a15b87f2be13444887a7e6d3fbf --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:17:19,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:17:19,762 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:19,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:17:19,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:17:19,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:17:19,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:17:19,789 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:17:19,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:17:19,790 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:17:19,790 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:17:19,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:17:19,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:17:19,791 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:17:19,791 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:17:19,791 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:17:19,791 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:17:19,791 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:17:19,791 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:17:19,791 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:17:19,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:17:19,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:17:19,791 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:17:19,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:17:19,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:17:19,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:17:19,792 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:17:19,792 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:17:19,792 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:17:19,792 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:17:19,792 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:17:19,792 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:17:19,792 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:17:19,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:17:19,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:17:19,792 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:17:19,792 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:17:19,792 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 -> 86d52fe8166d050ac731ccea951d586d64260a15b87f2be13444887a7e6d3fbf [2025-02-08 14:17:20,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:17:20,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:17:20,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:17:20,048 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:17:20,048 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:17:20,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-bwb/and-03.c [2025-02-08 14:17:21,177 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11b1c0019/c128da6ef8814aa0918128a04c7f3c0d/FLAG46df4e9db [2025-02-08 14:17:21,359 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:17:21,360 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-bwb/and-03.c [2025-02-08 14:17:21,367 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11b1c0019/c128da6ef8814aa0918128a04c7f3c0d/FLAG46df4e9db [2025-02-08 14:17:21,736 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11b1c0019/c128da6ef8814aa0918128a04c7f3c0d [2025-02-08 14:17:21,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:17:21,738 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:17:21,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:17:21,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:17:21,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:17:21,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:17:21" (1/1) ... [2025-02-08 14:17:21,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@728a6a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:21, skipping insertion in model container [2025-02-08 14:17:21,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:17:21" (1/1) ... [2025-02-08 14:17:21,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:17:21,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:17:21,847 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:17:21,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:17:21,864 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:17:21,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:21 WrapperNode [2025-02-08 14:17:21,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:17:21,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:17:21,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:17:21,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:17:21,871 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:21" (1/1) ... [2025-02-08 14:17:21,875 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:21" (1/1) ... [2025-02-08 14:17:21,884 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 22 [2025-02-08 14:17:21,885 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:17:21,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:17:21,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:17:21,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:17:21,891 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:21" (1/1) ... [2025-02-08 14:17:21,891 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:21" (1/1) ... [2025-02-08 14:17:21,892 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:21" (1/1) ... [2025-02-08 14:17:21,897 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-08 14:17:21,897 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:21" (1/1) ... [2025-02-08 14:17:21,897 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:21" (1/1) ... [2025-02-08 14:17:21,899 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:21" (1/1) ... [2025-02-08 14:17:21,900 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:21" (1/1) ... [2025-02-08 14:17:21,901 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:21" (1/1) ... [2025-02-08 14:17:21,902 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:21" (1/1) ... [2025-02-08 14:17:21,903 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:17:21,903 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:17:21,903 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:17:21,903 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:17:21,904 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:21" (1/1) ... [2025-02-08 14:17:21,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:21,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:21,930 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:21,934 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:21,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:17:21,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:17:21,992 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:17:21,993 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:17:22,083 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-02-08 14:17:22,083 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:17:22,098 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:17:22,098 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:17:22,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:17:22 BoogieIcfgContainer [2025-02-08 14:17:22,100 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:17:22,100 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:17:22,101 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:17:22,105 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:17:22,106 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:17:22,106 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:17:21" (1/3) ... [2025-02-08 14:17:22,108 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4892a72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:17:22, skipping insertion in model container [2025-02-08 14:17:22,108 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:17:22,108 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:21" (2/3) ... [2025-02-08 14:17:22,108 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4892a72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:17:22, skipping insertion in model container [2025-02-08 14:17:22,108 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:17:22,108 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:17:22" (3/3) ... [2025-02-08 14:17:22,109 INFO L363 chiAutomizerObserver]: Analyzing ICFG and-03.c [2025-02-08 14:17:22,162 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:17:22,163 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:17:22,163 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:17:22,163 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:17:22,163 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:17:22,164 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:17:22,164 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:17:22,164 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:17:22,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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:22,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-08 14:17:22,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:17:22,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:17:22,185 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:17:22,186 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:17:22,186 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:17:22,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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:22,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-08 14:17:22,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:17:22,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:17:22,188 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:17:22,188 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:17:22,193 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~bitwise1#1, main_#t~post2#1, main_~x~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;" [2025-02-08 14:17:22,194 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 != main_~x~0#1;" "assume !(main_~x~0#1 > 0);main_#t~post2#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" [2025-02-08 14:17:22,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:22,198 INFO L85 PathProgramCache]: Analyzing trace with hash 42, now seen corresponding path program 1 times [2025-02-08 14:17:22,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:22,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482423817] [2025-02-08 14:17:22,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:22,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:22,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:17:22,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:17:22,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:22,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:22,261 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:22,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:17:22,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:17:22,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:22,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:22,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:22,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:22,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1279, now seen corresponding path program 1 times [2025-02-08 14:17:22,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:22,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128863789] [2025-02-08 14:17:22,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:22,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:22,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:17:22,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:17:22,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:22,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:22,299 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:22,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:17:22,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:17:22,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:22,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:22,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:22,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:22,310 INFO L85 PathProgramCache]: Analyzing trace with hash 40680, now seen corresponding path program 1 times [2025-02-08 14:17:22,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:22,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242442180] [2025-02-08 14:17:22,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:22,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:22,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:17:22,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:17:22,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:22,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:22,314 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:22,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:17:22,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:17:22,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:22,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:22,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:22,380 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:17:22,380 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:17:22,381 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:17:22,381 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:17:22,381 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:17:22,381 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:22,381 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:17:22,381 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:17:22,381 INFO L132 ssoRankerPreferences]: Filename of dumped script: and-03.c_Iteration1_Loop [2025-02-08 14:17:22,381 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:17:22,381 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:17:22,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:22,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:22,472 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:17:22,473 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:17:22,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:22,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:22,476 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:22,478 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:22,479 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:17:22,479 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:17:22,497 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-02-08 14:17:22,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:22,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:22,500 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:22,501 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:22,502 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:17:22,502 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:17:22,526 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:17:22,531 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:22,531 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:17:22,531 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:17:22,531 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:17:22,531 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:17:22,532 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:17:22,532 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:22,532 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:17:22,532 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:17:22,532 INFO L132 ssoRankerPreferences]: Filename of dumped script: and-03.c_Iteration1_Loop [2025-02-08 14:17:22,532 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:17:22,532 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:17:22,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:22,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:22,582 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:17:22,586 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:17:22,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:22,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:22,593 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:22,596 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:22,597 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:22,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:22,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:17:22,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:22,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:22,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:22,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:17:22,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:17:22,618 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:17:22,622 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-02-08 14:17:22,624 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:17:22,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:22,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:22,684 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:22,685 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:22,685 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:17:22,686 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:17:22,686 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:17:22,687 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = -1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2025-02-08 14:17:22,694 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:22,698 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:17:22,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:22,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:17:22,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:17:22,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:22,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:22,733 WARN L254 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:17:22,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:17:22,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:17:22,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:17:22,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:22,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:22,745 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:17:22,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:17:22,756 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:22,785 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-02-08 14:17:22,786 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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:22,845 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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 28 states and 40 transitions. Complement of second has 6 states. [2025-02-08 14:17:22,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-08 14:17:22,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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:22,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2025-02-08 14:17:22,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 1 letters. Loop has 2 letters. [2025-02-08 14:17:22,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:22,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-08 14:17:22,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:22,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 1 letters. Loop has 4 letters. [2025-02-08 14:17:22,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:22,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2025-02-08 14:17:22,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-08 14:17:22,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 14 states and 20 transitions. [2025-02-08 14:17:22,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-02-08 14:17:22,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-02-08 14:17:22,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2025-02-08 14:17:22,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:17:22,877 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2025-02-08 14:17:22,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2025-02-08 14:17:22,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-02-08 14:17:22,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 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-02-08 14:17:22,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2025-02-08 14:17:22,904 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2025-02-08 14:17:22,904 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2025-02-08 14:17:22,904 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:17:22,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2025-02-08 14:17:22,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-08 14:17:22,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:17:22,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:17:22,906 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-08 14:17:22,906 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:17:22,906 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~bitwise1#1, main_#t~post2#1, main_~x~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;" "assume 0 != main_~x~0#1;" "assume main_~x~0#1 > 0;" "assume 0 == main_~x~0#1 || 0 == main_~x~0#1 - 1;main_#t~bitwise1#1 := 0;" [2025-02-08 14:17:22,906 INFO L754 eck$LassoCheckResult]: Loop: "main_~x~0#1 := main_#t~bitwise1#1;havoc main_#t~bitwise1#1;" "assume 0 != main_~x~0#1;" "assume main_~x~0#1 > 0;" "assume 0 == main_~x~0#1 || 0 == main_~x~0#1 - 1;main_#t~bitwise1#1 := 0;" [2025-02-08 14:17:22,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:22,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1261113, now seen corresponding path program 1 times [2025-02-08 14:17:22,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:22,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568369100] [2025-02-08 14:17:22,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:22,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:22,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:17:22,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:17:22,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:22,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:22,918 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:22,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:17:22,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:17:22,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:22,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:22,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:22,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:22,926 INFO L85 PathProgramCache]: Analyzing trace with hash 963203, now seen corresponding path program 1 times [2025-02-08 14:17:22,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:22,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014878067] [2025-02-08 14:17:22,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:22,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:22,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:17:22,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:17:22,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:22,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:22,933 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:22,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:17:22,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:17:22,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:22,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:22,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:22,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:22,945 INFO L85 PathProgramCache]: Analyzing trace with hash 728241339, now seen corresponding path program 1 times [2025-02-08 14:17:22,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:22,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516845616] [2025-02-08 14:17:22,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:22,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:22,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:17:22,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:17:22,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:22,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:23,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:17:23,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:17:23,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516845616] [2025-02-08 14:17:23,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516845616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:17:23,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:17:23,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:17:23,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388471631] [2025-02-08 14:17:23,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:17:23,052 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:17:23,053 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:17:23,053 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:17:23,053 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:17:23,053 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:17:23,053 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:23,053 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:17:23,053 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:17:23,053 INFO L132 ssoRankerPreferences]: Filename of dumped script: and-03.c_Iteration2_Loop [2025-02-08 14:17:23,053 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:17:23,053 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:17:23,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:23,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:23,085 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:17:23,085 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:17:23,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:23,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:23,089 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:23,092 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:23,093 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:17:23,093 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:17:23,120 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:23,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:23,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:23,125 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:23,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-08 14:17:23,131 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:17:23,132 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:17:23,152 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:17:23,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-08 14:17:23,166 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:17:23,166 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:17:23,166 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:17:23,166 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:17:23,166 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:17:23,166 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:23,166 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:17:23,166 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:17:23,166 INFO L132 ssoRankerPreferences]: Filename of dumped script: and-03.c_Iteration2_Loop [2025-02-08 14:17:23,166 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:17:23,166 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:17:23,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:23,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:23,204 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:17:23,205 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:17:23,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:23,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:23,208 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:23,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-08 14:17:23,218 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:23,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:23,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:17:23,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:23,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:23,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:23,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:17:23,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:17:23,237 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:17:23,242 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:17:23,242 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-08 14:17:23,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:23,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:23,245 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:23,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-08 14:17:23,247 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:17:23,247 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:17:23,247 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:17:23,247 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~bitwise1#1) = 1*ULTIMATE.start_main_#t~bitwise1#1 Supporting invariants [] [2025-02-08 14:17:23,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:23,254 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:17:23,258 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~bitwise1 [2025-02-08 14:17:23,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:23,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:17:23,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:17:23,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:23,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:23,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:17:23,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:17:23,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:17:23,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:17:23,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:23,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:23,290 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:17:23,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:17:23,337 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:23,338 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-08 14:17:23,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-08 14:17:23,339 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8 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-02-08 14:17:23,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:23,372 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8. 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 38 states and 54 transitions. Complement of second has 8 states. [2025-02-08 14:17:23,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-08 14:17:23,373 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-02-08 14:17:23,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2025-02-08 14:17:23,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 4 letters. Loop has 4 letters. [2025-02-08 14:17:23,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:23,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-08 14:17:23,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:23,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 4 letters. Loop has 8 letters. [2025-02-08 14:17:23,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:23,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 54 transitions. [2025-02-08 14:17:23,375 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-02-08 14:17:23,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 28 states and 39 transitions. [2025-02-08 14:17:23,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-02-08 14:17:23,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-02-08 14:17:23,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 39 transitions. [2025-02-08 14:17:23,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:17:23,376 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 39 transitions. [2025-02-08 14:17:23,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 39 transitions. [2025-02-08 14:17:23,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-02-08 14:17:23,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 25 states have internal predecessors, (36), 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:23,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2025-02-08 14:17:23,378 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 36 transitions. [2025-02-08 14:17:23,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:17:23,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:17:23,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:17:23,380 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. 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-02-08 14:17:23,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:17:23,399 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2025-02-08 14:17:23,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2025-02-08 14:17:23,399 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2025-02-08 14:17:23,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2025-02-08 14:17:23,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-02-08 14:17:23,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-02-08 14:17:23,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2025-02-08 14:17:23,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:17:23,400 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 29 transitions. [2025-02-08 14:17:23,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2025-02-08 14:17:23,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 14. [2025-02-08 14:17:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 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:23,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2025-02-08 14:17:23,405 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2025-02-08 14:17:23,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:17:23,406 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2025-02-08 14:17:23,406 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:17:23,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2025-02-08 14:17:23,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-02-08 14:17:23,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:17:23,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:17:23,407 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-08 14:17:23,407 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1] [2025-02-08 14:17:23,407 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~bitwise1#1, main_#t~post2#1, main_~x~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;" "assume 0 != main_~x~0#1;" "assume main_~x~0#1 > 0;" [2025-02-08 14:17:23,407 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == main_~x~0#1 || 0 == main_~x~0#1 - 1;main_#t~bitwise1#1 := 0;" "main_~x~0#1 := main_#t~bitwise1#1;havoc main_#t~bitwise1#1;" "assume 0 != main_~x~0#1;" "assume !(main_~x~0#1 > 0);main_#t~post2#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume 0 != main_~x~0#1;" "assume main_~x~0#1 > 0;" [2025-02-08 14:17:23,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:23,407 INFO L85 PathProgramCache]: Analyzing trace with hash 40681, now seen corresponding path program 1 times [2025-02-08 14:17:23,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:23,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536491069] [2025-02-08 14:17:23,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:23,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:23,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:17:23,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:17:23,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:23,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:23,410 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:23,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:17:23,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:17:23,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:23,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:23,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:23,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:23,412 INFO L85 PathProgramCache]: Analyzing trace with hash 945991421, now seen corresponding path program 1 times [2025-02-08 14:17:23,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:23,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851813912] [2025-02-08 14:17:23,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:23,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:23,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:17:23,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:17:23,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:23,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:23,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:17:23,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:17:23,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851813912] [2025-02-08 14:17:23,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851813912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:17:23,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:17:23,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:17:23,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449259295] [2025-02-08 14:17:23,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:17:23,461 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:17:23,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:17:23,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:17:23,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:17:23,461 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:17:23,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:17:23,483 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2025-02-08 14:17:23,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2025-02-08 14:17:23,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-08 14:17:23,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 11 states and 13 transitions. [2025-02-08 14:17:23,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-08 14:17:23,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-08 14:17:23,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2025-02-08 14:17:23,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:17:23,485 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-02-08 14:17:23,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2025-02-08 14:17:23,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2025-02-08 14:17:23,486 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:23,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2025-02-08 14:17:23,486 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2025-02-08 14:17:23,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:17:23,487 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2025-02-08 14:17:23,487 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-08 14:17:23,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2025-02-08 14:17:23,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-08 14:17:23,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:17:23,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:17:23,488 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-08 14:17:23,488 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:17:23,489 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~bitwise1#1, main_#t~post2#1, main_~x~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;" "assume 0 != main_~x~0#1;" [2025-02-08 14:17:23,489 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x~0#1 > 0;" "assume !(0 == main_~x~0#1 || 0 == main_~x~0#1 - 1);" "assume !(main_~x~0#1 == main_~x~0#1 - 1);" "havoc main_#t~bitwise1#1;assume (((((main_~x~0#1 < 0 && main_~x~0#1 - 1 >= 0) || main_#t~bitwise1#1 <= main_~x~0#1) && ((main_~x~0#1 >= 0 && main_~x~0#1 - 1 < 0) || main_#t~bitwise1#1 <= main_~x~0#1 - 1)) && ((main_~x~0#1 < 0 && main_~x~0#1 - 1 < 0) || main_#t~bitwise1#1 >= 0)) && ((main_~x~0#1 >= 0 && main_~x~0#1 - 1 >= 0) || main_#t~bitwise1#1 > main_~x~0#1 + (main_~x~0#1 - 1))) && main_#t~bitwise1#1 >= -2147483648;" "main_~x~0#1 := main_#t~bitwise1#1;havoc main_#t~bitwise1#1;" "assume 0 != main_~x~0#1;" [2025-02-08 14:17:23,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:23,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1312, now seen corresponding path program 1 times [2025-02-08 14:17:23,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:23,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159345871] [2025-02-08 14:17:23,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:23,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:23,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:17:23,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:17:23,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:23,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:23,494 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:23,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:17:23,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:17:23,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:23,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:23,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:23,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:23,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1151821967, now seen corresponding path program 1 times [2025-02-08 14:17:23,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:23,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877727507] [2025-02-08 14:17:23,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:23,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:23,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:17:23,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:17:23,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:23,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:23,506 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:23,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:17:23,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:17:23,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:23,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:23,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:23,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:23,513 INFO L85 PathProgramCache]: Analyzing trace with hash 733010542, now seen corresponding path program 1 times [2025-02-08 14:17:23,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:23,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776260954] [2025-02-08 14:17:23,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:23,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:23,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:17:23,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:17:23,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:23,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:23,523 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:23,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:17:23,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:17:23,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:23,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:23,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:23,583 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:17:23,584 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:17:23,584 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:17:23,584 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:17:23,584 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:17:23,584 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:23,584 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:17:23,584 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:17:23,584 INFO L132 ssoRankerPreferences]: Filename of dumped script: and-03.c_Iteration4_Loop [2025-02-08 14:17:23,584 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:17:23,584 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:17:23,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:23,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:23,612 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:17:23,612 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:17:23,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:23,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:23,614 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:23,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-08 14:17:23,617 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:17:23,617 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:17:23,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-08 14:17:23,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:23,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:23,636 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:23,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-08 14:17:23,637 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:17:23,638 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:17:23,674 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:17:23,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-02-08 14:17:23,682 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:17:23,682 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:17:23,682 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:17:23,682 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:17:23,682 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:17:23,682 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:23,682 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:17:23,683 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:17:23,683 INFO L132 ssoRankerPreferences]: Filename of dumped script: and-03.c_Iteration4_Loop [2025-02-08 14:17:23,683 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:17:23,683 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:17:23,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:23,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:23,716 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:17:23,717 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:17:23,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:23,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:23,719 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:23,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-08 14:17:23,723 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:23,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:23,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:17:23,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:23,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:23,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:23,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:17:23,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:17:23,735 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:17:23,738 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:17:23,738 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-08 14:17:23,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:23,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:23,740 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:23,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-08 14:17:23,743 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:17:23,743 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:17:23,743 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:17:23,743 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2025-02-08 14:17:23,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:23,750 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:17:23,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:23,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:17:23,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:17:23,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:23,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:23,767 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:17:23,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:17:23,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:17:23,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:17:23,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:23,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:23,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:17:23,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:17:23,820 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:23,821 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-02-08 14:17:23,821 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-02-08 14:17:23,851 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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 24 states and 27 transitions. Complement of second has 9 states. [2025-02-08 14:17:23,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-02-08 14:17:23,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-02-08 14:17:23,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2025-02-08 14:17:23,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 2 letters. Loop has 6 letters. [2025-02-08 14:17:23,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:23,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 8 letters. Loop has 6 letters. [2025-02-08 14:17:23,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:23,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 2 letters. Loop has 12 letters. [2025-02-08 14:17:23,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:23,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. [2025-02-08 14:17:23,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-08 14:17:23,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 11 states and 12 transitions. [2025-02-08 14:17:23,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-02-08 14:17:23,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-02-08 14:17:23,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2025-02-08 14:17:23,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:17:23,855 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-02-08 14:17:23,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2025-02-08 14:17:23,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2025-02-08 14:17:23,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:17:23,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2025-02-08 14:17:23,856 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-02-08 14:17:23,856 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-02-08 14:17:23,856 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-08 14:17:23,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2025-02-08 14:17:23,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-08 14:17:23,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:17:23,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:17:23,856 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1] [2025-02-08 14:17:23,856 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:17:23,856 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~bitwise1#1, main_#t~post2#1, main_~x~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;" "assume 0 != main_~x~0#1;" "assume !(main_~x~0#1 > 0);main_#t~post2#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume 0 != main_~x~0#1;" [2025-02-08 14:17:23,856 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x~0#1 > 0;" "assume !(0 == main_~x~0#1 || 0 == main_~x~0#1 - 1);" "assume !(main_~x~0#1 == main_~x~0#1 - 1);" "havoc main_#t~bitwise1#1;assume (((((main_~x~0#1 < 0 && main_~x~0#1 - 1 >= 0) || main_#t~bitwise1#1 <= main_~x~0#1) && ((main_~x~0#1 >= 0 && main_~x~0#1 - 1 < 0) || main_#t~bitwise1#1 <= main_~x~0#1 - 1)) && ((main_~x~0#1 < 0 && main_~x~0#1 - 1 < 0) || main_#t~bitwise1#1 >= 0)) && ((main_~x~0#1 >= 0 && main_~x~0#1 - 1 >= 0) || main_#t~bitwise1#1 > main_~x~0#1 + (main_~x~0#1 - 1))) && main_#t~bitwise1#1 >= -2147483648;" "main_~x~0#1 := main_#t~bitwise1#1;havoc main_#t~bitwise1#1;" "assume 0 != main_~x~0#1;" [2025-02-08 14:17:23,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:23,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1261090, now seen corresponding path program 2 times [2025-02-08 14:17:23,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:23,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306767290] [2025-02-08 14:17:23,859 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:17:23,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:23,862 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 2 equivalence classes. [2025-02-08 14:17:23,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:17:23,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:17:23,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:23,866 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:23,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:17:23,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:17:23,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:23,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:23,870 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:23,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:23,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1151821967, now seen corresponding path program 2 times [2025-02-08 14:17:23,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:23,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597297969] [2025-02-08 14:17:23,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:17:23,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:23,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:17:23,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:17:23,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:17:23,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:23,876 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:23,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:17:23,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:17:23,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:23,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:23,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:23,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:23,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1048693232, now seen corresponding path program 1 times [2025-02-08 14:17:23,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:23,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468298025] [2025-02-08 14:17:23,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:23,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:23,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:17:23,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:17:23,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:23,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:23,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:17:23,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:17:23,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468298025] [2025-02-08 14:17:23,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468298025] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:17:23,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950688587] [2025-02-08 14:17:23,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:23,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:17:23,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:23,944 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:17:23,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 14:17:23,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:17:23,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:17:23,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:23,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:23,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:17:23,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:17:23,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:17:23,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:17:23,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950688587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:17:23,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:17:23,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 14:17:23,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298768472] [2025-02-08 14:17:23,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:17:24,023 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:17:24,023 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:17:24,023 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:17:24,023 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:17:24,023 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:17:24,023 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:24,023 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:17:24,024 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:17:24,024 INFO L132 ssoRankerPreferences]: Filename of dumped script: and-03.c_Iteration5_Loop [2025-02-08 14:17:24,024 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:17:24,024 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:17:24,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:24,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:24,049 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:17:24,049 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:17:24,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:24,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:24,051 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:24,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-08 14:17:24,054 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:17:24,054 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:17:24,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-02-08 14:17:24,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:24,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:24,071 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:24,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-08 14:17:24,073 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:17:24,073 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:17:24,109 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:17:24,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-08 14:17:24,114 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:17:24,114 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:17:24,114 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:17:24,114 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:17:24,114 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:17:24,114 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:24,114 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:17:24,114 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:17:24,114 INFO L132 ssoRankerPreferences]: Filename of dumped script: and-03.c_Iteration5_Loop [2025-02-08 14:17:24,114 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:17:24,114 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:17:24,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:24,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:24,147 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:17:24,148 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:17:24,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:24,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:24,149 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:24,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-08 14:17:24,152 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:24,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:24,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:17:24,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:24,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:24,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:24,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:17:24,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:17:24,166 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:17:24,168 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:17:24,168 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-08 14:17:24,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:24,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:24,170 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:24,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-08 14:17:24,173 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:17:24,173 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:17:24,173 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:17:24,173 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2025-02-08 14:17:24,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:24,181 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:17:24,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:24,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:17:24,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:17:24,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:24,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:24,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:17:24,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:17:24,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:17:24,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:17:24,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:24,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:24,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:17:24,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:17:24,270 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:24,270 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-02-08 14:17:24,271 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 3 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:17:24,276 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 3. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 11 states and 12 transitions. Complement of second has 3 states. [2025-02-08 14:17:24,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-08 14:17:24,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:17:24,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2025-02-08 14:17:24,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 4 letters. Loop has 6 letters. [2025-02-08 14:17:24,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:24,277 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:17:24,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:24,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:17:24,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:17:24,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:24,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:24,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:17:24,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:17:24,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:17:24,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:17:24,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:24,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:24,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:17:24,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:17:24,334 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:24,335 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2025-02-08 14:17:24,335 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 3 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:17:24,338 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 3. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 11 states and 12 transitions. Complement of second has 3 states. [2025-02-08 14:17:24,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-08 14:17:24,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:17:24,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2025-02-08 14:17:24,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 4 letters. Loop has 6 letters. [2025-02-08 14:17:24,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:24,339 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:17:24,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:24,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:17:24,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:17:24,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:24,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:24,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:17:24,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:17:24,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:17:24,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:17:24,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:24,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:24,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:17:24,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:17:24,404 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-02-08 14:17:24,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:24,414 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:24,415 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 4 loop predicates [2025-02-08 14:17:24,415 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 3 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:17:24,441 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 3. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 19 transitions. Complement of second has 8 states. [2025-02-08 14:17:24,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-02-08 14:17:24,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:17:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2025-02-08 14:17:24,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 4 letters. Loop has 6 letters. [2025-02-08 14:17:24,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:24,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 10 letters. Loop has 6 letters. [2025-02-08 14:17:24,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:24,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 4 letters. Loop has 12 letters. [2025-02-08 14:17:24,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:24,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2025-02-08 14:17:24,443 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:17:24,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 0 states and 0 transitions. [2025-02-08 14:17:24,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-08 14:17:24,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-08 14:17:24,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-08 14:17:24,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:17:24,444 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:17:24,444 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:17:24,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:17:24,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:17:24,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:17:24,444 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:17:24,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:17:24,445 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-02-08 14:17:24,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-02-08 14:17:24,445 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:17:24,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 14:17:24,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-08 14:17:24,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-08 14:17:24,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-08 14:17:24,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:17:24,445 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:17:24,445 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:17:24,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 14:17:24,446 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:17:24,446 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-08 14:17:24,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-08 14:17:24,446 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:17:24,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-08 14:17:24,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:17:24 BoogieIcfgContainer [2025-02-08 14:17:24,452 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:17:24,452 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:17:24,452 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:17:24,452 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:17:24,453 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:22" (3/4) ... [2025-02-08 14:17:24,454 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 14:17:24,455 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:17:24,455 INFO L158 Benchmark]: Toolchain (without parser) took 2716.95ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 108.1MB in the end (delta: 5.8MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2025-02-08 14:17:24,455 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:17:24,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 125.46ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 103.9MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:17:24,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.72ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 103.0MB in the end (delta: 903.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:17:24,456 INFO L158 Benchmark]: Boogie Preprocessor took 17.53ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 102.0MB in the end (delta: 929.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:17:24,456 INFO L158 Benchmark]: IcfgBuilder took 196.72ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 91.9MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:17:24,456 INFO L158 Benchmark]: BuchiAutomizer took 2351.32ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 108.9MB in the end (delta: -17.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:17:24,456 INFO L158 Benchmark]: Witness Printer took 2.48ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 108.1MB in the end (delta: 823.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:17:24,457 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.44ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 125.46ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 103.9MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.72ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 103.0MB in the end (delta: 903.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.53ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 102.0MB in the end (delta: 929.3kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 196.72ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 91.9MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 2351.32ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 108.9MB in the end (delta: -17.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.48ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 108.1MB in the end (delta: 823.8kB). 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: Unknown variable: #t~bitwise1 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function ((long) -1 * x) and consists of 4 locations. One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function x and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 55 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 121 IncrementalHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 38 mSDtfsCounter, 121 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq157 hnf95 smp69 dnf100 smp100 tf116 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 99ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-08 14:17:24,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:24,667 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