./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-bwb/and-03.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-8fc3dc6-m [2025-03-17 19:49:43,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:49:43,170 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-17 19:49:43,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:49:43,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:49:43,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 19:49:43,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:49:43,196 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:49:43,196 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:49:43,197 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:49:43,197 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:49:43,198 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:49:43,198 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:49:43,198 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:49:43,198 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 19:49:43,198 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 19:49:43,198 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 19:49:43,198 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 19:49:43,198 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 19:49:43,198 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 19:49:43,199 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:49:43,199 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 19:49:43,199 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:49:43,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:49:43,199 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 19:49:43,199 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 19:49:43,199 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 19:49:43,199 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:49:43,200 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:49:43,200 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 19:49:43,200 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:49:43,200 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:49:43,200 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:49:43,200 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:49:43,201 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:49:43,201 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:49:43,201 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 19:49:43,201 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/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-03-17 19:49:43,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:49:43,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:49:43,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:49:43,425 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:49:43,425 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:49:43,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-bwb/and-03.c [2025-03-17 19:49:44,562 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c6767793/b9eee6f71e2a43d284045ef5fc5883f6/FLAG8f12f6e84 [2025-03-17 19:49:44,759 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:49:44,760 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-bwb/and-03.c [2025-03-17 19:49:44,770 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c6767793/b9eee6f71e2a43d284045ef5fc5883f6/FLAG8f12f6e84 [2025-03-17 19:49:44,795 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c6767793/b9eee6f71e2a43d284045ef5fc5883f6 [2025-03-17 19:49:44,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:49:44,798 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:49:44,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:49:44,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:49:44,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:49:44,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:49:44" (1/1) ... [2025-03-17 19:49:44,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5069a45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:44, skipping insertion in model container [2025-03-17 19:49:44,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:49:44" (1/1) ... [2025-03-17 19:49:44,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:49:44,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:49:44,903 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:49:44,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:49:44,920 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:49:44,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:44 WrapperNode [2025-03-17 19:49:44,921 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:49:44,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:49:44,922 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:49:44,922 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:49:44,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:44" (1/1) ... [2025-03-17 19:49:44,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:44" (1/1) ... [2025-03-17 19:49:44,937 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 22 [2025-03-17 19:49:44,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:49:44,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:49:44,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:49:44,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:49:44,942 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:44" (1/1) ... [2025-03-17 19:49:44,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:44" (1/1) ... [2025-03-17 19:49:44,943 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:44" (1/1) ... [2025-03-17 19:49:44,946 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 19:49:44,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:44" (1/1) ... [2025-03-17 19:49:44,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:44" (1/1) ... [2025-03-17 19:49:44,947 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:44" (1/1) ... [2025-03-17 19:49:44,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:44" (1/1) ... [2025-03-17 19:49:44,948 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:44" (1/1) ... [2025-03-17 19:49:44,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:44" (1/1) ... [2025-03-17 19:49:44,949 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:49:44,949 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:49:44,949 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:49:44,949 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:49:44,951 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:44" (1/1) ... [2025-03-17 19:49:44,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:44,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:44,977 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:49:44,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-17 19:49:45,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:49:45,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:49:45,034 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:49:45,035 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:49:45,095 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-03-17 19:49:45,096 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:49:45,107 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:49:45,107 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:49:45,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:49:45 BoogieIcfgContainer [2025-03-17 19:49:45,108 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:49:45,108 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 19:49:45,108 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 19:49:45,112 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 19:49:45,112 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:49:45,112 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 07:49:44" (1/3) ... [2025-03-17 19:49:45,113 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43e2e522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:49:45, skipping insertion in model container [2025-03-17 19:49:45,113 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:49:45,113 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:44" (2/3) ... [2025-03-17 19:49:45,113 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43e2e522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:49:45, skipping insertion in model container [2025-03-17 19:49:45,113 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:49:45,113 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:49:45" (3/3) ... [2025-03-17 19:49:45,114 INFO L363 chiAutomizerObserver]: Analyzing ICFG and-03.c [2025-03-17 19:49:45,142 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 19:49:45,142 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 19:49:45,142 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 19:49:45,142 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 19:49:45,142 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 19:49:45,143 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 19:49:45,143 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 19:49:45,143 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 19:49:45,145 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-03-17 19:49:45,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:49:45,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:49:45,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:49:45,157 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:49:45,157 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:49:45,157 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 19:49:45,157 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-03-17 19:49:45,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:49:45,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:49:45,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:49:45,159 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:49:45,159 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:49:45,163 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-03-17 19:49:45,164 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-03-17 19:49:45,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:45,167 INFO L85 PathProgramCache]: Analyzing trace with hash 42, now seen corresponding path program 1 times [2025-03-17 19:49:45,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:45,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329047283] [2025-03-17 19:49:45,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:45,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:45,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:49:45,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:49:45,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:45,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:45,219 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:45,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:49:45,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:49:45,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:45,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:45,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:45,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:45,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1279, now seen corresponding path program 1 times [2025-03-17 19:49:45,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:45,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487655720] [2025-03-17 19:49:45,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:45,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:45,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:49:45,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:49:45,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:45,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:45,245 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:45,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:49:45,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:49:45,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:45,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:45,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:45,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:45,249 INFO L85 PathProgramCache]: Analyzing trace with hash 40680, now seen corresponding path program 1 times [2025-03-17 19:49:45,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:45,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976755544] [2025-03-17 19:49:45,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:45,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:45,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:49:45,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:49:45,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:45,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:45,253 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:45,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:49:45,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:49:45,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:45,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:45,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:45,322 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:49:45,323 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:49:45,323 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:49:45,323 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:49:45,323 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:49:45,323 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:45,324 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:49:45,324 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:49:45,324 INFO L132 ssoRankerPreferences]: Filename of dumped script: and-03.c_Iteration1_Loop [2025-03-17 19:49:45,324 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:49:45,324 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:49:45,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:45,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:45,412 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:49:45,412 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:49:45,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:45,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:45,417 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:49:45,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-17 19:49:45,420 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:49:45,420 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:49:45,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-17 19:49:45,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:45,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:45,463 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:49:45,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-17 19:49:45,467 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:49:45,467 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:49:45,502 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:49:45,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-17 19:49:45,509 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:49:45,509 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:49:45,509 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:49:45,509 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:49:45,509 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:49:45,509 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:45,509 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:49:45,509 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:49:45,509 INFO L132 ssoRankerPreferences]: Filename of dumped script: and-03.c_Iteration1_Loop [2025-03-17 19:49:45,509 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:49:45,509 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:49:45,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:45,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:45,563 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:49:45,566 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:49:45,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:45,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:45,569 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:49:45,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-17 19:49:45,572 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-03-17 19:49:45,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:49:45,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:49:45,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:49:45,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:49:45,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:49:45,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:49:45,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:49:45,592 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:49:45,595 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-17 19:49:45,597 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:49:45,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:45,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:45,602 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:49:45,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-17 19:49:45,606 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:49:45,606 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:49:45,607 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:49:45,607 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-03-17 19:49:45,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-17 19:49:45,616 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:49:45,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:45,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:49:45,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:49:45,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:45,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:45,652 WARN L254 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:49:45,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:49:45,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:49:45,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:49:45,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:45,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:45,661 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:49:45,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:49:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:49:45,686 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-03-17 19:49:45,688 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-03-17 19:49:45,727 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-03-17 19:49:45,728 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-03-17 19:49:45,731 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-03-17 19:49:45,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2025-03-17 19:49:45,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 1 letters. Loop has 2 letters. [2025-03-17 19:49:45,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:49:45,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 3 letters. Loop has 2 letters. [2025-03-17 19:49:45,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:49:45,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 1 letters. Loop has 4 letters. [2025-03-17 19:49:45,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:49:45,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2025-03-17 19:49:45,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:49:45,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 14 states and 20 transitions. [2025-03-17 19:49:45,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-17 19:49:45,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-03-17 19:49:45,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2025-03-17 19:49:45,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:49:45,745 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2025-03-17 19:49:45,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2025-03-17 19:49:45,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-03-17 19:49:45,765 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-03-17 19:49:45,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2025-03-17 19:49:45,766 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2025-03-17 19:49:45,767 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2025-03-17 19:49:45,767 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 19:49:45,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2025-03-17 19:49:45,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:49:45,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:49:45,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:49:45,767 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:49:45,767 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:49:45,768 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-03-17 19:49:45,768 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-03-17 19:49:45,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:45,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1261113, now seen corresponding path program 1 times [2025-03-17 19:49:45,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:45,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250956921] [2025-03-17 19:49:45,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:45,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:45,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:49:45,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:49:45,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:45,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:45,773 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:45,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:49:45,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:49:45,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:45,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:45,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:45,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:45,776 INFO L85 PathProgramCache]: Analyzing trace with hash 963203, now seen corresponding path program 1 times [2025-03-17 19:49:45,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:45,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557040463] [2025-03-17 19:49:45,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:45,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:45,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:49:45,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:49:45,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:45,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:45,780 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:45,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:49:45,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:49:45,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:45,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:45,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:45,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:45,785 INFO L85 PathProgramCache]: Analyzing trace with hash 728241339, now seen corresponding path program 1 times [2025-03-17 19:49:45,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:45,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320643391] [2025-03-17 19:49:45,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:45,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:45,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:49:45,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:49:45,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:45,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:45,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:49:45,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:49:45,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320643391] [2025-03-17 19:49:45,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320643391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:49:45,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:49:45,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:49:45,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007901578] [2025-03-17 19:49:45,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:49:45,875 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:49:45,875 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:49:45,875 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:49:45,875 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:49:45,875 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:49:45,875 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:45,875 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:49:45,875 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:49:45,875 INFO L132 ssoRankerPreferences]: Filename of dumped script: and-03.c_Iteration2_Loop [2025-03-17 19:49:45,875 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:49:45,875 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:49:45,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:45,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:45,901 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:49:45,901 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:49:45,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:45,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:45,903 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:49:45,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-17 19:49:45,906 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:49:45,906 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:49:45,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-17 19:49:45,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:45,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:45,924 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:49:45,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-17 19:49:45,926 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:49:45,926 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:49:45,938 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:49:45,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-17 19:49:45,944 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:49:45,944 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:49:45,944 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:49:45,944 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:49:45,944 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:49:45,944 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:45,944 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:49:45,944 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:49:45,944 INFO L132 ssoRankerPreferences]: Filename of dumped script: and-03.c_Iteration2_Loop [2025-03-17 19:49:45,944 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:49:45,944 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:49:45,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:45,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:45,969 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:49:45,969 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:49:45,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:45,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:45,971 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:49:45,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-17 19:49:45,973 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-03-17 19:49:45,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:49:45,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:49:45,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:49:45,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:49:45,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:49:45,986 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:49:45,986 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:49:45,987 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:49:45,989 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:49:45,989 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:49:45,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:45,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:45,992 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:49:45,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-17 19:49:45,993 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:49:45,994 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:49:45,994 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:49:45,994 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-03-17 19:49:46,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-17 19:49:46,001 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:49:46,002 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~bitwise1 [2025-03-17 19:49:46,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:46,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:49:46,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:49:46,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:46,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:46,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:49:46,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:49:46,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:49:46,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:49:46,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:46,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:46,022 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:49:46,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:49:46,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:49:46,043 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-03-17 19:49:46,043 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-03-17 19:49:46,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-17 19:49:46,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-17 19:49:46,087 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-03-17 19:49:46,087 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-03-17 19:49:46,088 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-03-17 19:49:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2025-03-17 19:49:46,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 4 letters. Loop has 4 letters. [2025-03-17 19:49:46,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:49:46,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 4 letters. [2025-03-17 19:49:46,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:49:46,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 4 letters. Loop has 8 letters. [2025-03-17 19:49:46,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:49:46,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 54 transitions. [2025-03-17 19:49:46,089 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-03-17 19:49:46,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 28 states and 39 transitions. [2025-03-17 19:49:46,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-03-17 19:49:46,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-03-17 19:49:46,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 39 transitions. [2025-03-17 19:49:46,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:49:46,091 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 39 transitions. [2025-03-17 19:49:46,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 39 transitions. [2025-03-17 19:49:46,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-03-17 19:49:46,092 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-03-17 19:49:46,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2025-03-17 19:49:46,093 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 36 transitions. [2025-03-17 19:49:46,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:49:46,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:49:46,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:49:46,095 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-03-17 19:49:46,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:49:46,117 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2025-03-17 19:49:46,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2025-03-17 19:49:46,118 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2025-03-17 19:49:46,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2025-03-17 19:49:46,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-03-17 19:49:46,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-03-17 19:49:46,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2025-03-17 19:49:46,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:49:46,119 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 29 transitions. [2025-03-17 19:49:46,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2025-03-17 19:49:46,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 14. [2025-03-17 19:49:46,119 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-03-17 19:49:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2025-03-17 19:49:46,120 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2025-03-17 19:49:46,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:49:46,120 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2025-03-17 19:49:46,120 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 19:49:46,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2025-03-17 19:49:46,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-03-17 19:49:46,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:49:46,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:49:46,121 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 19:49:46,121 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1] [2025-03-17 19:49:46,121 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-03-17 19:49:46,121 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-03-17 19:49:46,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:46,121 INFO L85 PathProgramCache]: Analyzing trace with hash 40681, now seen corresponding path program 1 times [2025-03-17 19:49:46,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:46,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965683976] [2025-03-17 19:49:46,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:46,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:46,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:49:46,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:49:46,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:46,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:46,124 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:46,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:49:46,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:49:46,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:46,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:46,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:46,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:46,125 INFO L85 PathProgramCache]: Analyzing trace with hash 945991421, now seen corresponding path program 1 times [2025-03-17 19:49:46,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:46,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958013640] [2025-03-17 19:49:46,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:46,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:46,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:49:46,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:49:46,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:46,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:46,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:49:46,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:49:46,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958013640] [2025-03-17 19:49:46,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958013640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:49:46,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:49:46,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:49:46,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229907047] [2025-03-17 19:49:46,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:49:46,159 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:49:46,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:49:46,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:49:46,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:49:46,160 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-03-17 19:49:46,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:49:46,177 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2025-03-17 19:49:46,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2025-03-17 19:49:46,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:49:46,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 11 states and 13 transitions. [2025-03-17 19:49:46,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-17 19:49:46,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 19:49:46,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2025-03-17 19:49:46,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:49:46,177 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-03-17 19:49:46,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2025-03-17 19:49:46,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2025-03-17 19:49:46,178 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-03-17 19:49:46,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2025-03-17 19:49:46,178 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2025-03-17 19:49:46,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:49:46,179 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2025-03-17 19:49:46,179 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 19:49:46,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2025-03-17 19:49:46,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:49:46,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:49:46,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:49:46,180 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 19:49:46,180 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:49:46,180 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-03-17 19:49:46,180 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-03-17 19:49:46,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:46,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1312, now seen corresponding path program 1 times [2025-03-17 19:49:46,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:46,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837468054] [2025-03-17 19:49:46,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:46,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:46,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:49:46,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:49:46,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:46,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:46,183 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:46,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:49:46,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:49:46,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:46,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:46,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:46,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:46,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1151821967, now seen corresponding path program 1 times [2025-03-17 19:49:46,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:46,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201823476] [2025-03-17 19:49:46,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:46,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:46,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:49:46,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:49:46,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:46,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:46,195 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:46,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:49:46,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:49:46,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:46,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:46,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:46,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:46,199 INFO L85 PathProgramCache]: Analyzing trace with hash 733010542, now seen corresponding path program 1 times [2025-03-17 19:49:46,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:46,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722273965] [2025-03-17 19:49:46,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:46,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:46,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:49:46,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:49:46,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:46,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:46,204 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:46,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:49:46,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:49:46,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:46,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:46,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:46,250 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:49:46,250 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:49:46,250 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:49:46,250 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:49:46,250 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:49:46,250 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:46,250 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:49:46,250 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:49:46,250 INFO L132 ssoRankerPreferences]: Filename of dumped script: and-03.c_Iteration4_Loop [2025-03-17 19:49:46,250 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:49:46,250 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:49:46,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:46,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:46,275 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:49:46,275 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:49:46,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:46,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:46,277 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:49:46,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-17 19:49:46,279 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:49:46,280 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:49:46,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-17 19:49:46,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:46,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:46,297 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:49:46,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-17 19:49:46,299 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:49:46,299 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:49:46,336 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:49:46,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-17 19:49:46,340 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:49:46,340 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:49:46,340 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:49:46,340 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:49:46,340 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:49:46,340 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:46,340 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:49:46,340 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:49:46,340 INFO L132 ssoRankerPreferences]: Filename of dumped script: and-03.c_Iteration4_Loop [2025-03-17 19:49:46,340 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:49:46,340 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:49:46,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:46,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:46,375 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:49:46,376 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:49:46,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:46,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:46,377 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:49:46,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-17 19:49:46,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:49:46,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:49:46,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:49:46,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:49:46,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:49:46,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:49:46,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:49:46,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:49:46,393 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:49:46,396 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:49:46,396 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:49:46,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:46,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:46,424 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:49:46,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-17 19:49:46,427 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:49:46,427 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:49:46,427 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:49:46,427 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-03-17 19:49:46,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-17 19:49:46,452 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:49:46,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:46,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:49:46,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:49:46,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:46,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:46,467 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:49:46,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:49:46,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:49:46,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:49:46,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:46,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:46,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:49:46,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:49:46,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:49:46,538 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-03-17 19:49:46,538 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-03-17 19:49:46,562 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-03-17 19:49:46,563 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-03-17 19:49:46,564 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-03-17 19:49:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2025-03-17 19:49:46,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 2 letters. Loop has 6 letters. [2025-03-17 19:49:46,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:49:46,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 8 letters. Loop has 6 letters. [2025-03-17 19:49:46,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:49:46,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 2 letters. Loop has 12 letters. [2025-03-17 19:49:46,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:49:46,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. [2025-03-17 19:49:46,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:49:46,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 11 states and 12 transitions. [2025-03-17 19:49:46,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 19:49:46,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-17 19:49:46,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2025-03-17 19:49:46,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:49:46,565 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-03-17 19:49:46,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2025-03-17 19:49:46,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2025-03-17 19:49:46,566 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-03-17 19:49:46,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2025-03-17 19:49:46,566 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-03-17 19:49:46,566 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-03-17 19:49:46,566 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 19:49:46,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2025-03-17 19:49:46,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:49:46,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:49:46,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:49:46,568 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1] [2025-03-17 19:49:46,568 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:49:46,568 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-03-17 19:49:46,568 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-03-17 19:49:46,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:46,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1261090, now seen corresponding path program 2 times [2025-03-17 19:49:46,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:46,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633943367] [2025-03-17 19:49:46,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:49:46,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:46,573 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 2 equivalence classes. [2025-03-17 19:49:46,576 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:49:46,576 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:49:46,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:46,576 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:46,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:49:46,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:49:46,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:46,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:46,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:46,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:46,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1151821967, now seen corresponding path program 2 times [2025-03-17 19:49:46,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:46,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636629841] [2025-03-17 19:49:46,578 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:49:46,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:46,585 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:49:46,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:49:46,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:49:46,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:46,591 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:46,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:49:46,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:49:46,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:46,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:46,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:46,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:46,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1048693232, now seen corresponding path program 1 times [2025-03-17 19:49:46,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:46,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419699316] [2025-03-17 19:49:46,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:46,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:46,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:49:46,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:49:46,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:46,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:46,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:49:46,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:49:46,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419699316] [2025-03-17 19:49:46,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419699316] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:49:46,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737130206] [2025-03-17 19:49:46,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:46,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:49:46,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:46,643 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:49:46,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 19:49:46,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:49:46,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:49:46,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:46,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:46,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:49:46,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:49:46,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:49:46,675 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:49:46,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737130206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:49:46,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:49:46,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 19:49:46,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076973947] [2025-03-17 19:49:46,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:49:46,721 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:49:46,722 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:49:46,722 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:49:46,722 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:49:46,722 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:49:46,722 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:46,722 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:49:46,722 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:49:46,722 INFO L132 ssoRankerPreferences]: Filename of dumped script: and-03.c_Iteration5_Loop [2025-03-17 19:49:46,722 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:49:46,722 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:49:46,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:46,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:46,749 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:49:46,749 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:49:46,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:46,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:46,751 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:49:46,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-17 19:49:46,754 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:49:46,754 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:49:46,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-17 19:49:46,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:46,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:46,772 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:49:46,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-17 19:49:46,774 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:49:46,774 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:49:46,809 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:49:46,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-17 19:49:46,813 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:49:46,814 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:49:46,814 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:49:46,814 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:49:46,814 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:49:46,814 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:46,814 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:49:46,814 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:49:46,814 INFO L132 ssoRankerPreferences]: Filename of dumped script: and-03.c_Iteration5_Loop [2025-03-17 19:49:46,814 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:49:46,814 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:49:46,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:46,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:46,844 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:49:46,844 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:49:46,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:46,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:46,847 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:49:46,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-17 19:49:46,849 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-03-17 19:49:46,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:49:46,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:49:46,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:49:46,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:49:46,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:49:46,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:49:46,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:49:46,862 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:49:46,864 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:49:46,864 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:49:46,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:46,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:46,866 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:49:46,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-17 19:49:46,868 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:49:46,868 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:49:46,868 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:49:46,868 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-03-17 19:49:46,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-17 19:49:46,874 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:49:46,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:46,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:49:46,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:49:46,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:46,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:46,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:49:46,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:49:46,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:49:46,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:49:46,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:46,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:46,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:49:46,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:49:46,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:49:46,943 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-03-17 19:49:46,943 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-03-17 19:49:46,946 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-03-17 19:49:46,947 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-03-17 19:49:46,947 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-03-17 19:49:46,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2025-03-17 19:49:46,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 4 letters. Loop has 6 letters. [2025-03-17 19:49:46,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:49:46,947 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:49:46,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:46,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:49:46,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:49:46,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:46,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:46,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:49:46,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:49:46,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:49:46,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:49:46,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:46,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:46,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:49:46,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:49:47,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:49:47,024 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-03-17 19:49:47,024 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-03-17 19:49:47,027 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-03-17 19:49:47,028 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-03-17 19:49:47,028 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-03-17 19:49:47,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2025-03-17 19:49:47,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 4 letters. Loop has 6 letters. [2025-03-17 19:49:47,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:49:47,028 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:49:47,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:47,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:49:47,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:49:47,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:47,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:47,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:49:47,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:49:47,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:49:47,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:49:47,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:47,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:47,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:49:47,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:49:47,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:49:47,117 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-03-17 19:49:47,118 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-03-17 19:49:47,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-17 19:49:47,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-17 19:49:47,159 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-03-17 19:49:47,159 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-03-17 19:49:47,161 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-03-17 19:49:47,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2025-03-17 19:49:47,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 4 letters. Loop has 6 letters. [2025-03-17 19:49:47,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:49:47,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 10 letters. Loop has 6 letters. [2025-03-17 19:49:47,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:49:47,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 4 letters. Loop has 12 letters. [2025-03-17 19:49:47,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:49:47,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2025-03-17 19:49:47,162 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 19:49:47,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 0 states and 0 transitions. [2025-03-17 19:49:47,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 19:49:47,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 19:49:47,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 19:49:47,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:49:47,162 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:49:47,162 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:49:47,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:49:47,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:49:47,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:49:47,163 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-03-17 19:49:47,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:49:47,163 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-03-17 19:49:47,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-03-17 19:49:47,163 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 19:49:47,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 19:49:47,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 19:49:47,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 19:49:47,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 19:49:47,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:49:47,163 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:49:47,163 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:49:47,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 19:49:47,163 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:49:47,163 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 19:49:47,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-17 19:49:47,163 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 19:49:47,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-17 19:49:47,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 07:49:47 BoogieIcfgContainer [2025-03-17 19:49:47,170 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 19:49:47,170 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 19:49:47,170 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 19:49:47,170 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 19:49:47,171 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:49:45" (3/4) ... [2025-03-17 19:49:47,172 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 19:49:47,172 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 19:49:47,173 INFO L158 Benchmark]: Toolchain (without parser) took 2374.84ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 110.1MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2025-03-17 19:49:47,173 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:49:47,173 INFO L158 Benchmark]: CACSL2BoogieTranslator took 122.06ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 103.7MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:49:47,173 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.76ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 102.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:49:47,173 INFO L158 Benchmark]: Boogie Preprocessor took 11.18ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 101.7MB in the end (delta: 997.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:49:47,173 INFO L158 Benchmark]: IcfgBuilder took 158.53ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 91.7MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:49:47,174 INFO L158 Benchmark]: BuchiAutomizer took 2061.45ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 110.1MB in the end (delta: -18.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:49:47,174 INFO L158 Benchmark]: Witness Printer took 2.37ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 110.1MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:49:47,175 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.15ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 122.06ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 103.7MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 15.76ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 102.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 11.18ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 101.7MB in the end (delta: 997.6kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 158.53ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 91.7MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 2061.45ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 110.1MB in the end (delta: -18.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.37ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 110.1MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: 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.0s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 1.3s. Construction of modules took 0.0s. 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: 39ms 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-03-17 19:49:47,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 19:49:47,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE