./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/Urban-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed 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-memory-alloca/Urban-alloca-2.i -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 1d6689857addc69d8e93b105a4c59c28f3ca430e8db3cb8066938aeb93b34a30 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:52:58,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:52:58,673 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-09 06:52:58,677 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:52:58,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:52:58,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 06:52:58,702 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:52:58,704 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:52:58,704 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:52:58,704 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:52:58,705 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:52:58,705 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:52:58,705 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:52:58,705 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:52:58,705 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 06:52:58,706 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 06:52:58,706 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 06:52:58,706 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 06:52:58,706 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 06:52:58,707 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 06:52:58,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:52:58,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 06:52:58,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:52:58,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:52:58,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 06:52:58,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 06:52:58,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 06:52:58,707 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:52:58,707 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:52:58,707 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 06:52:58,707 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:52:58,708 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:52:58,708 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:52:58,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:52:58,708 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:52:58,708 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:52:58,713 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 06:52:58,713 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 -> 1d6689857addc69d8e93b105a4c59c28f3ca430e8db3cb8066938aeb93b34a30 [2025-03-09 06:52:58,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:52:58,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:52:58,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:52:58,950 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:52:58,950 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:52:58,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/Urban-alloca-2.i [2025-03-09 06:53:00,105 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db08a9d73/16eba2b308704a2e9c4a3c170e29a85f/FLAG330c679f6 [2025-03-09 06:53:00,356 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:53:00,357 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Urban-alloca-2.i [2025-03-09 06:53:00,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db08a9d73/16eba2b308704a2e9c4a3c170e29a85f/FLAG330c679f6 [2025-03-09 06:53:00,679 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db08a9d73/16eba2b308704a2e9c4a3c170e29a85f [2025-03-09 06:53:00,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:53:00,681 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:53:00,682 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:53:00,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:53:00,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:53:00,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:53:00" (1/1) ... [2025-03-09 06:53:00,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15f8cb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:00, skipping insertion in model container [2025-03-09 06:53:00,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:53:00" (1/1) ... [2025-03-09 06:53:00,705 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:53:00,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:53:00,864 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:53:00,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:53:00,908 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:53:00,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:00 WrapperNode [2025-03-09 06:53:00,908 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:53:00,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:53:00,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:53:00,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:53:00,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:00" (1/1) ... [2025-03-09 06:53:00,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:00" (1/1) ... [2025-03-09 06:53:00,929 INFO L138 Inliner]: procedures = 110, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 62 [2025-03-09 06:53:00,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:53:00,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:53:00,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:53:00,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:53:00,934 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:00" (1/1) ... [2025-03-09 06:53:00,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:00" (1/1) ... [2025-03-09 06:53:00,936 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:00" (1/1) ... [2025-03-09 06:53:00,943 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [7, 8]. 53 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 8 writes are split as follows [4, 4]. [2025-03-09 06:53:00,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:00" (1/1) ... [2025-03-09 06:53:00,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:00" (1/1) ... [2025-03-09 06:53:00,948 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:00" (1/1) ... [2025-03-09 06:53:00,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:00" (1/1) ... [2025-03-09 06:53:00,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:00" (1/1) ... [2025-03-09 06:53:00,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:00" (1/1) ... [2025-03-09 06:53:00,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:53:00,951 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:53:00,951 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:53:00,951 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:53:00,952 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:00" (1/1) ... [2025-03-09 06:53:00,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:00,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:00,980 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-09 06:53:00,983 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-09 06:53:00,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:53:00,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:53:00,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:53:01,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:53:01,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 06:53:01,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:53:01,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:53:01,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:53:01,058 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:53:01,060 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:53:01,142 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-09 06:53:01,142 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:53:01,148 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:53:01,148 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:53:01,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:53:01 BoogieIcfgContainer [2025-03-09 06:53:01,148 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:53:01,149 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 06:53:01,149 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 06:53:01,152 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 06:53:01,153 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:53:01,153 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 06:53:00" (1/3) ... [2025-03-09 06:53:01,154 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37ee2bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:53:01, skipping insertion in model container [2025-03-09 06:53:01,154 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:53:01,154 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:00" (2/3) ... [2025-03-09 06:53:01,154 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37ee2bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:53:01, skipping insertion in model container [2025-03-09 06:53:01,154 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:53:01,154 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:53:01" (3/3) ... [2025-03-09 06:53:01,155 INFO L363 chiAutomizerObserver]: Analyzing ICFG Urban-alloca-2.i [2025-03-09 06:53:01,190 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 06:53:01,190 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 06:53:01,190 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 06:53:01,191 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 06:53:01,191 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 06:53:01,191 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 06:53:01,191 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 06:53:01,192 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 06:53:01,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:01,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-09 06:53:01,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:01,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:01,213 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:53:01,213 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 06:53:01,213 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 06:53:01,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:01,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-09 06:53:01,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:01,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:01,215 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:53:01,215 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 06:53:01,219 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~short8#1, main_#t~mem9#1, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~nondet17#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet5#1;" [2025-03-09 06:53:01,219 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1;" "assume main_#t~short8#1;call main_#t~mem7#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0;" "assume main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume !(main_#t~mem9#1 > 0);havoc main_#t~mem9#1;havoc main_#t~nondet14#1;" "assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(1 + main_#t~mem15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem15#1;" [2025-03-09 06:53:01,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:01,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1504, now seen corresponding path program 1 times [2025-03-09 06:53:01,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:01,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050053732] [2025-03-09 06:53:01,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:01,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:01,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:53:01,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:53:01,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:01,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:01,305 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:01,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:53:01,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:53:01,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:01,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:01,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:01,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:01,339 INFO L85 PathProgramCache]: Analyzing trace with hash 41926730, now seen corresponding path program 1 times [2025-03-09 06:53:01,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:01,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528414210] [2025-03-09 06:53:01,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:01,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:01,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:53:01,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:53:01,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:01,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:01,360 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:01,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:53:01,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:53:01,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:01,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:01,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:01,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:01,379 INFO L85 PathProgramCache]: Analyzing trace with hash 121867723, now seen corresponding path program 1 times [2025-03-09 06:53:01,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:01,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518421824] [2025-03-09 06:53:01,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:01,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:01,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:53:01,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:53:01,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:01,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:01,417 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:01,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:53:01,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:53:01,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:01,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:01,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:01,863 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:01,864 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:01,865 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:01,865 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:01,865 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:01,866 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:01,866 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:01,866 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:01,866 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-alloca-2.i_Iteration1_Lasso [2025-03-09 06:53:01,866 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:01,867 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:01,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:01,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:01,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:01,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:01,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:01,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:01,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:01,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,395 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:02,397 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:02,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:02,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:02,401 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-09 06:53:02,402 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-09 06:53:02,404 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-09 06:53:02,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:02,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:02,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:02,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:02,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:02,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:02,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:02,420 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:02,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:02,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:02,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:02,430 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-09 06:53:02,431 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-09 06:53:02,434 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-09 06:53:02,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:02,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:02,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:02,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:02,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:02,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:02,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:02,448 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:02,453 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-09 06:53:02,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:02,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:02,456 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-09 06:53:02,457 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-09 06:53:02,459 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-09 06:53:02,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:02,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:02,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:02,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:02,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:02,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:02,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:02,471 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:02,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-09 06:53:02,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:02,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:02,478 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-09 06:53:02,479 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-09 06:53:02,480 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-09 06:53:02,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:02,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:02,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:02,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:02,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:02,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:02,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:02,491 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:02,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-09 06:53:02,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:02,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:02,498 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-09 06:53:02,499 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-09 06:53:02,499 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-09 06:53:02,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:02,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:02,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:02,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:02,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:02,510 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:02,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:02,511 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:02,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-09 06:53:02,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:02,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:02,519 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-09 06:53:02,521 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-09 06:53:02,522 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-09 06:53:02,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:02,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:02,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:02,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:02,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:02,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:02,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:02,534 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:02,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:02,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:02,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:02,540 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-09 06:53:02,541 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-09 06:53:02,542 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-09 06:53:02,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:02,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:02,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:02,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:02,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:02,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:02,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:02,553 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:02,558 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-09 06:53:02,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:02,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:02,560 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-09 06:53:02,560 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-09 06:53:02,561 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-09 06:53:02,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:02,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:02,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:02,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:02,575 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:02,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:02,579 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:02,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-09 06:53:02,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:02,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:02,589 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-09 06:53:02,590 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-09 06:53:02,591 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-09 06:53:02,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:02,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:02,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:02,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:02,605 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:02,605 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:02,609 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:02,625 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-09 06:53:02,627 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-09 06:53:02,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:02,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:02,631 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-09 06:53:02,633 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-09 06:53:02,634 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:02,644 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:53:02,645 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:02,645 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) 0)_1) = -1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) 0)_1 Supporting invariants [] [2025-03-09 06:53:02,650 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-09 06:53:02,677 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2025-03-09 06:53:02,684 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 06:53:02,685 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 06:53:02,685 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x~0!base,]]] [2025-03-09 06:53:02,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:02,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:53:02,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:53:02,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:02,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:02,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:53:02,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:02,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:53:02,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:53:02,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:02,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:02,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:53:02,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:02,801 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-09 06:53:02,822 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-09 06:53:02,824 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:02,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-09 06:53:02,930 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 51 transitions. Complement of second has 10 states. [2025-03-09 06:53:02,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:02,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:02,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2025-03-09 06:53:02,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 5 letters. [2025-03-09 06:53:02,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:02,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 7 letters. Loop has 5 letters. [2025-03-09 06:53:02,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:02,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 10 letters. [2025-03-09 06:53:02,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:02,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 51 transitions. [2025-03-09 06:53:02,944 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-09 06:53:02,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 23 states and 35 transitions. [2025-03-09 06:53:02,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-03-09 06:53:02,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-03-09 06:53:02,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 35 transitions. [2025-03-09 06:53:02,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:02,948 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 35 transitions. [2025-03-09 06:53:02,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 35 transitions. [2025-03-09 06:53:02,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2025-03-09 06:53:02,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:02,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2025-03-09 06:53:02,964 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 33 transitions. [2025-03-09 06:53:02,964 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 33 transitions. [2025-03-09 06:53:02,964 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 06:53:02,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 33 transitions. [2025-03-09 06:53:02,967 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-09 06:53:02,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:02,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:02,967 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-09 06:53:02,967 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 06:53:02,968 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~short8#1, main_#t~mem9#1, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~nondet17#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet5#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1;" [2025-03-09 06:53:02,968 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~short8#1;call main_#t~mem7#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0;" "assume main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume main_#t~mem9#1 > 0;havoc main_#t~mem9#1;havoc main_#t~nondet10#1;" "assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1;call main_#t~mem13#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#0(main_#t~mem13#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem13#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1;" [2025-03-09 06:53:02,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:02,970 INFO L85 PathProgramCache]: Analyzing trace with hash 46638, now seen corresponding path program 1 times [2025-03-09 06:53:02,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:02,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111121190] [2025-03-09 06:53:02,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:02,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:02,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:53:02,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:53:02,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:02,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:02,987 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:02,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:53:02,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:53:02,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:02,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:03,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:03,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:03,001 INFO L85 PathProgramCache]: Analyzing trace with hash 40043055, now seen corresponding path program 1 times [2025-03-09 06:53:03,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:03,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130521810] [2025-03-09 06:53:03,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:03,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:03,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:53:03,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:53:03,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:03,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:03,011 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:03,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:53:03,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:53:03,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:03,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:03,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:03,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:03,024 INFO L85 PathProgramCache]: Analyzing trace with hash -517070814, now seen corresponding path program 1 times [2025-03-09 06:53:03,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:03,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696142767] [2025-03-09 06:53:03,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:03,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:03,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:53:03,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:53:03,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:03,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:03,046 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:03,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:53:03,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:53:03,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:03,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:03,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:03,422 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:03,422 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:03,422 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:03,422 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:03,422 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:03,422 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:03,422 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:03,422 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:03,422 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-alloca-2.i_Iteration2_Lasso [2025-03-09 06:53:03,422 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:03,422 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:03,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,833 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:03,833 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:03,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:03,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:03,836 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-09 06:53:03,838 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-09 06:53:03,838 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-09 06:53:03,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:03,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:03,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:03,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:03,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:03,848 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:03,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:03,849 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:03,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-09 06:53:03,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:03,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:03,857 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-09 06:53:03,858 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-09 06:53:03,859 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-09 06:53:03,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:03,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:03,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:03,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:03,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:03,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:03,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:03,871 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:03,877 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-09 06:53:03,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:03,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:03,879 INFO L229 MonitoredProcess]: Starting monitored process 14 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-09 06:53:03,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-09 06:53:03,883 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-09 06:53:03,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:03,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:03,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:03,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:03,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:03,893 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:03,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:03,894 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:03,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:03,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:03,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:03,900 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-09 06:53:03,901 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-09 06:53:03,902 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-09 06:53:03,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:03,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:03,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:03,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:03,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:03,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:03,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:03,913 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:03,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-09 06:53:03,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:03,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:03,920 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-09 06:53:03,921 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-09 06:53:03,924 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-09 06:53:03,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:03,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:03,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:03,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:03,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:03,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:03,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:03,935 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:03,940 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-09 06:53:03,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:03,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:03,942 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-09 06:53:03,943 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-09 06:53:03,944 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-09 06:53:03,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:03,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:03,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:03,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:03,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:03,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:03,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:03,955 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:03,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-09 06:53:03,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:03,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:03,962 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-09 06:53:03,963 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-09 06:53:03,965 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-09 06:53:03,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:03,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:03,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:03,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:03,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:03,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:03,982 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:03,988 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-09 06:53:03,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:03,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:03,990 INFO L229 MonitoredProcess]: Starting monitored process 19 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-09 06:53:03,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-09 06:53:03,994 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-09 06:53:04,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:04,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:04,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:04,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:04,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:04,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:04,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:04,007 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:04,011 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:53:04,011 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 06:53:04,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:04,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:04,013 INFO L229 MonitoredProcess]: Starting monitored process 20 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-09 06:53:04,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-09 06:53:04,016 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:04,016 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:53:04,016 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:04,016 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_2) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_2 Supporting invariants [] [2025-03-09 06:53:04,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:04,040 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-03-09 06:53:04,041 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:53:04,041 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:53:04,041 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~y~0!base,]]] [2025-03-09 06:53:04,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:04,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:53:04,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:53:04,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:04,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:04,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:53:04,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:04,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:53:04,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:53:04,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:04,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:04,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 06:53:04,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:04,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2025-03-09 06:53:04,138 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-09 06:53:04,139 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-09 06:53:04,139 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 33 transitions. cyclomatic complexity: 14 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-09 06:53:04,168 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 33 transitions. cyclomatic complexity: 14. 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 61 states and 94 transitions. Complement of second has 9 states. [2025-03-09 06:53:04,169 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-09 06:53:04,169 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-09 06:53:04,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2025-03-09 06:53:04,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 3 letters. Loop has 5 letters. [2025-03-09 06:53:04,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:04,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 8 letters. Loop has 5 letters. [2025-03-09 06:53:04,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:04,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 3 letters. Loop has 10 letters. [2025-03-09 06:53:04,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:04,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 94 transitions. [2025-03-09 06:53:04,172 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-09 06:53:04,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 59 states and 92 transitions. [2025-03-09 06:53:04,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-03-09 06:53:04,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-03-09 06:53:04,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 92 transitions. [2025-03-09 06:53:04,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:04,173 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 92 transitions. [2025-03-09 06:53:04,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 92 transitions. [2025-03-09 06:53:04,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 46. [2025-03-09 06:53:04,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.608695652173913) internal successors, (74), 45 states have internal predecessors, (74), 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-09 06:53:04,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 74 transitions. [2025-03-09 06:53:04,179 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 74 transitions. [2025-03-09 06:53:04,179 INFO L432 stractBuchiCegarLoop]: Abstraction has 46 states and 74 transitions. [2025-03-09 06:53:04,179 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 06:53:04,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 74 transitions. [2025-03-09 06:53:04,180 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-09 06:53:04,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:04,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:04,181 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:04,181 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 06:53:04,182 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~short8#1, main_#t~mem9#1, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~nondet17#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet5#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1;" "assume !main_#t~short8#1;" "assume main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume main_#t~mem9#1 > 0;havoc main_#t~mem9#1;havoc main_#t~nondet10#1;" "assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~nondet12#1;call write~int#0(main_#t~nondet12#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet12#1;" [2025-03-09 06:53:04,182 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1;" "assume main_#t~short8#1;call main_#t~mem7#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0;" "assume main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume main_#t~mem9#1 > 0;havoc main_#t~mem9#1;havoc main_#t~nondet10#1;" "assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~nondet12#1;call write~int#0(main_#t~nondet12#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet12#1;" [2025-03-09 06:53:04,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:04,182 INFO L85 PathProgramCache]: Analyzing trace with hash 121897418, now seen corresponding path program 1 times [2025-03-09 06:53:04,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:04,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550909676] [2025-03-09 06:53:04,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:04,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:04,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:53:04,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:53:04,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:04,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:04,248 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-09 06:53:04,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:53:04,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550909676] [2025-03-09 06:53:04,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550909676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:53:04,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:53:04,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:53:04,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341795618] [2025-03-09 06:53:04,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:53:04,251 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:53:04,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:04,252 INFO L85 PathProgramCache]: Analyzing trace with hash 41926634, now seen corresponding path program 1 times [2025-03-09 06:53:04,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:04,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383376817] [2025-03-09 06:53:04,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:04,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:04,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:53:04,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:53:04,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:04,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:04,263 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:04,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:53:04,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:53:04,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:04,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:04,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:04,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:53:04,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:53:04,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:53:04,386 INFO L87 Difference]: Start difference. First operand 46 states and 74 transitions. cyclomatic complexity: 34 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:04,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:53:04,398 INFO L93 Difference]: Finished difference Result 53 states and 74 transitions. [2025-03-09 06:53:04,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 74 transitions. [2025-03-09 06:53:04,399 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-09 06:53:04,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 46 states and 62 transitions. [2025-03-09 06:53:04,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-03-09 06:53:04,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-03-09 06:53:04,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 62 transitions. [2025-03-09 06:53:04,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:04,399 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 62 transitions. [2025-03-09 06:53:04,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 62 transitions. [2025-03-09 06:53:04,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-09 06:53:04,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 45 states have internal predecessors, (62), 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-09 06:53:04,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2025-03-09 06:53:04,404 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 62 transitions. [2025-03-09 06:53:04,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:53:04,405 INFO L432 stractBuchiCegarLoop]: Abstraction has 46 states and 62 transitions. [2025-03-09 06:53:04,406 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 06:53:04,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 62 transitions. [2025-03-09 06:53:04,407 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-09 06:53:04,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:04,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:04,407 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:04,408 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 06:53:04,408 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~short8#1, main_#t~mem9#1, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~nondet17#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet5#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1;" "assume main_#t~short8#1;call main_#t~mem7#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0;" "assume main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume main_#t~mem9#1 > 0;havoc main_#t~mem9#1;havoc main_#t~nondet10#1;" "assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~nondet12#1;call write~int#0(main_#t~nondet12#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet12#1;" [2025-03-09 06:53:04,408 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1;" "assume main_#t~short8#1;call main_#t~mem7#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0;" "assume main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume main_#t~mem9#1 > 0;havoc main_#t~mem9#1;havoc main_#t~nondet10#1;" "assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~nondet12#1;call write~int#0(main_#t~nondet12#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet12#1;" [2025-03-09 06:53:04,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:04,408 INFO L85 PathProgramCache]: Analyzing trace with hash 121867627, now seen corresponding path program 1 times [2025-03-09 06:53:04,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:04,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118588659] [2025-03-09 06:53:04,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:04,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:04,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:53:04,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:53:04,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:04,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:04,424 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:04,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:53:04,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:53:04,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:04,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:04,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:04,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:04,442 INFO L85 PathProgramCache]: Analyzing trace with hash 41926634, now seen corresponding path program 2 times [2025-03-09 06:53:04,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:04,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391980521] [2025-03-09 06:53:04,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:53:04,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:04,450 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:53:04,456 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:53:04,456 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:53:04,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:04,457 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:04,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:53:04,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:53:04,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:04,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:04,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:04,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:04,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1565394112, now seen corresponding path program 2 times [2025-03-09 06:53:04,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:04,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283875599] [2025-03-09 06:53:04,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:53:04,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:04,472 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-09 06:53:04,477 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:53:04,478 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:53:04,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:04,478 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:04,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:53:04,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:53:04,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:04,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:04,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:04,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:04,836 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:04,836 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:04,836 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:04,836 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:04,836 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:04,836 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:04,836 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:04,836 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:04,836 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-alloca-2.i_Iteration4_Lasso [2025-03-09 06:53:04,836 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:04,836 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:04,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:05,143 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:05,143 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:05,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:05,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:05,145 INFO L229 MonitoredProcess]: Starting monitored process 21 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-09 06:53:05,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-09 06:53:05,147 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-09 06:53:05,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:05,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:05,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:05,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:05,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:05,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:05,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:05,158 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:05,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:05,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:05,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:05,165 INFO L229 MonitoredProcess]: Starting monitored process 22 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-09 06:53:05,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-09 06:53:05,167 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-09 06:53:05,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:05,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:05,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:05,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:05,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:05,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:05,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:05,178 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:05,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-09 06:53:05,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:05,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:05,185 INFO L229 MonitoredProcess]: Starting monitored process 23 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-09 06:53:05,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-09 06:53:05,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:53:05,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:05,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:05,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:05,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:05,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:05,196 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:05,196 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:05,197 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:05,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-09 06:53:05,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:05,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:05,205 INFO L229 MonitoredProcess]: Starting monitored process 24 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-09 06:53:05,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-09 06:53:05,207 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-09 06:53:05,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:05,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:05,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:05,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:05,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:05,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:05,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:05,218 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:05,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:05,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:05,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:05,225 INFO L229 MonitoredProcess]: Starting monitored process 25 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-09 06:53:05,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-09 06:53:05,228 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-09 06:53:05,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:05,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:05,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:05,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:05,239 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:05,239 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:05,243 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:05,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:05,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:05,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:05,250 INFO L229 MonitoredProcess]: Starting monitored process 26 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-09 06:53:05,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-09 06:53:05,253 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-09 06:53:05,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:05,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:05,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:05,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:05,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:05,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:05,271 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:05,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:05,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:05,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:05,279 INFO L229 MonitoredProcess]: Starting monitored process 27 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-09 06:53:05,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-09 06:53:05,281 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-09 06:53:05,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:05,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:05,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:05,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:05,295 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:05,295 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:05,299 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:05,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:05,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:05,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:05,307 INFO L229 MonitoredProcess]: Starting monitored process 28 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-09 06:53:05,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-09 06:53:05,310 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-09 06:53:05,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:05,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:05,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:05,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:05,321 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:05,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:05,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:05,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:05,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:05,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:05,332 INFO L229 MonitoredProcess]: Starting monitored process 29 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-09 06:53:05,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-09 06:53:05,334 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-09 06:53:05,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:05,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:05,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:05,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:05,345 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:05,345 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:05,348 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:05,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:05,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:05,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:05,359 INFO L229 MonitoredProcess]: Starting monitored process 30 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-09 06:53:05,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-09 06:53:05,360 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-09 06:53:05,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:05,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:05,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:05,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:05,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:05,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:05,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:05,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:05,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-09 06:53:05,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:05,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:05,377 INFO L229 MonitoredProcess]: Starting monitored process 31 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-09 06:53:05,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-09 06:53:05,379 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-09 06:53:05,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:05,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:05,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:05,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:05,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:05,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:05,391 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:05,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-09 06:53:05,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:05,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:05,398 INFO L229 MonitoredProcess]: Starting monitored process 32 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-09 06:53:05,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-09 06:53:05,400 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-09 06:53:05,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:05,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:05,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:05,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:05,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:05,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:05,415 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:05,418 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-09 06:53:05,418 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-03-09 06:53:05,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:05,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:05,420 INFO L229 MonitoredProcess]: Starting monitored process 33 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-09 06:53:05,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-09 06:53:05,431 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:05,441 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:53:05,441 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:05,441 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_3) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_3 Supporting invariants [] [2025-03-09 06:53:05,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-09 06:53:05,465 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-03-09 06:53:05,466 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 06:53:05,466 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 06:53:05,466 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x~0!base,]]] [2025-03-09 06:53:05,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:05,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:53:05,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:53:05,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:05,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:05,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:53:05,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:05,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:53:05,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:53:05,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:05,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:05,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 06:53:05,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:05,534 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-09 06:53:05,534 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-09 06:53:05,535 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 62 transitions. cyclomatic complexity: 22 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-09 06:53:05,599 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 62 transitions. cyclomatic complexity: 22. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 68 states and 91 transitions. Complement of second has 11 states. [2025-03-09 06:53:05,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:05,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-09 06:53:05,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2025-03-09 06:53:05,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 7 letters. Loop has 5 letters. [2025-03-09 06:53:05,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:05,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 12 letters. Loop has 5 letters. [2025-03-09 06:53:05,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:05,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 7 letters. Loop has 10 letters. [2025-03-09 06:53:05,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:05,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 91 transitions. [2025-03-09 06:53:05,602 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2025-03-09 06:53:05,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 66 states and 89 transitions. [2025-03-09 06:53:05,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2025-03-09 06:53:05,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2025-03-09 06:53:05,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 89 transitions. [2025-03-09 06:53:05,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:05,602 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 89 transitions. [2025-03-09 06:53:05,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 89 transitions. [2025-03-09 06:53:05,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2025-03-09 06:53:05,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 57 states have internal predecessors, (78), 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-09 06:53:05,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2025-03-09 06:53:05,605 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 78 transitions. [2025-03-09 06:53:05,605 INFO L432 stractBuchiCegarLoop]: Abstraction has 58 states and 78 transitions. [2025-03-09 06:53:05,605 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 06:53:05,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 78 transitions. [2025-03-09 06:53:05,606 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2025-03-09 06:53:05,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:05,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:05,606 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:05,606 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 06:53:05,607 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~short8#1, main_#t~mem9#1, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~nondet17#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet5#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1;" "assume main_#t~short8#1;call main_#t~mem7#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0;" "assume main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume main_#t~mem9#1 > 0;havoc main_#t~mem9#1;havoc main_#t~nondet10#1;" "assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~nondet12#1;call write~int#0(main_#t~nondet12#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet12#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1;" [2025-03-09 06:53:05,607 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~short8#1;call main_#t~mem7#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0;" "assume main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume main_#t~mem9#1 > 0;havoc main_#t~mem9#1;havoc main_#t~nondet10#1;" "assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1;call main_#t~mem13#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#0(main_#t~mem13#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem13#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1;" [2025-03-09 06:53:05,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:05,607 INFO L85 PathProgramCache]: Analyzing trace with hash -517070845, now seen corresponding path program 3 times [2025-03-09 06:53:05,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:05,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71990839] [2025-03-09 06:53:05,607 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:53:05,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:05,615 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 2 equivalence classes. [2025-03-09 06:53:05,623 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:53:05,623 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 06:53:05,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:05,623 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:05,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:53:05,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:53:05,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:05,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:05,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:05,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:05,642 INFO L85 PathProgramCache]: Analyzing trace with hash 40043055, now seen corresponding path program 2 times [2025-03-09 06:53:05,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:05,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885387647] [2025-03-09 06:53:05,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:53:05,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:05,647 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:53:05,649 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:53:05,649 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:53:05,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:05,649 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:05,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:53:05,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:53:05,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:05,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:05,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:05,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:05,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1282577261, now seen corresponding path program 1 times [2025-03-09 06:53:05,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:05,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156314471] [2025-03-09 06:53:05,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:05,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:05,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:53:05,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:53:05,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:05,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:05,681 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:05,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:53:05,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:53:05,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:05,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:05,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:06,134 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:06,134 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:06,134 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:06,134 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:06,134 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:06,134 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:06,134 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:06,134 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:06,135 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-alloca-2.i_Iteration5_Lasso [2025-03-09 06:53:06,135 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:06,135 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:06,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,546 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:06,546 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:06,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:06,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:06,548 INFO L229 MonitoredProcess]: Starting monitored process 34 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-09 06:53:06,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-09 06:53:06,551 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-09 06:53:06,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:06,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:06,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:06,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:06,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:06,561 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:06,561 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:06,563 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:06,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-09 06:53:06,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:06,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:06,570 INFO L229 MonitoredProcess]: Starting monitored process 35 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-09 06:53:06,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-09 06:53:06,571 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-09 06:53:06,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:06,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:06,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:06,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:06,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:06,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:06,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:06,582 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:06,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-09 06:53:06,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:06,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:06,589 INFO L229 MonitoredProcess]: Starting monitored process 36 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-09 06:53:06,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-09 06:53:06,591 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-09 06:53:06,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:06,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:06,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:06,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:06,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:06,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:06,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:06,602 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:06,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-09 06:53:06,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:06,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:06,609 INFO L229 MonitoredProcess]: Starting monitored process 37 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-09 06:53:06,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-09 06:53:06,611 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-09 06:53:06,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:06,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:06,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:06,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:06,622 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:06,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:06,626 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:06,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-09 06:53:06,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:06,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:06,633 INFO L229 MonitoredProcess]: Starting monitored process 38 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-09 06:53:06,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-09 06:53:06,635 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-09 06:53:06,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:06,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:06,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:06,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:06,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:06,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:06,652 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:06,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-09 06:53:06,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:06,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:06,660 INFO L229 MonitoredProcess]: Starting monitored process 39 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-09 06:53:06,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-09 06:53:06,662 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-09 06:53:06,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:06,672 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-09 06:53:06,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:06,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:06,673 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-09 06:53:06,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:06,678 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:06,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:06,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:06,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:06,684 INFO L229 MonitoredProcess]: Starting monitored process 40 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-09 06:53:06,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-09 06:53:06,686 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-09 06:53:06,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:06,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:06,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:06,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:06,698 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:06,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:06,703 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:06,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-03-09 06:53:06,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:06,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:06,710 INFO L229 MonitoredProcess]: Starting monitored process 41 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-09 06:53:06,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-09 06:53:06,711 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-09 06:53:06,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:06,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:06,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:06,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:06,723 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:06,723 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:06,728 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:06,737 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-09 06:53:06,737 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-09 06:53:06,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:06,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:06,740 INFO L229 MonitoredProcess]: Starting monitored process 42 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-09 06:53:06,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-09 06:53:06,742 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:06,752 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:53:06,752 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:06,752 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~y~0#1.base) 0)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~y~0#1.base) 0)_1 Supporting invariants [] [2025-03-09 06:53:06,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-09 06:53:06,775 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2025-03-09 06:53:06,776 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:53:06,777 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:53:06,777 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~y~0!base,]]] [2025-03-09 06:53:06,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:06,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:53:06,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:53:06,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:06,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:06,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:53:06,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:06,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:53:06,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:53:06,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:06,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:06,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:53:06,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:06,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2025-03-09 06:53:06,905 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-09 06:53:06,906 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2025-03-09 06:53:06,906 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 78 transitions. cyclomatic complexity: 28 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:06,952 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 78 transitions. cyclomatic complexity: 28. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 114 states and 145 transitions. Complement of second has 10 states. [2025-03-09 06:53:06,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:06,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:06,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2025-03-09 06:53:06,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 8 letters. Loop has 5 letters. [2025-03-09 06:53:06,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:06,953 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:06,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:06,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:53:06,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:53:06,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:06,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:06,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:53:06,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:07,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:53:07,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:53:07,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:07,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:07,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:53:07,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:07,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-03-09 06:53:07,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-09 06:53:07,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2025-03-09 06:53:07,096 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-09 06:53:07,097 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2025-03-09 06:53:07,097 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 78 transitions. cyclomatic complexity: 28 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:07,159 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 78 transitions. cyclomatic complexity: 28. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 109 states and 142 transitions. Complement of second has 10 states. [2025-03-09 06:53:07,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:07,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:07,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2025-03-09 06:53:07,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 8 letters. Loop has 5 letters. [2025-03-09 06:53:07,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:07,160 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:07,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:07,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:53:07,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:53:07,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:07,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:07,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:53:07,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:07,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:53:07,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:53:07,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:07,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:07,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:53:07,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:07,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2025-03-09 06:53:07,265 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-09 06:53:07,265 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2025-03-09 06:53:07,266 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 78 transitions. cyclomatic complexity: 28 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:07,314 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 78 transitions. cyclomatic complexity: 28. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 146 states and 182 transitions. Complement of second has 14 states. [2025-03-09 06:53:07,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:07,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:07,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2025-03-09 06:53:07,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 8 letters. Loop has 5 letters. [2025-03-09 06:53:07,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:07,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 13 letters. Loop has 5 letters. [2025-03-09 06:53:07,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:07,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 8 letters. Loop has 10 letters. [2025-03-09 06:53:07,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:07,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146 states and 182 transitions. [2025-03-09 06:53:07,317 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2025-03-09 06:53:07,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146 states to 94 states and 119 transitions. [2025-03-09 06:53:07,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-09 06:53:07,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2025-03-09 06:53:07,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 119 transitions. [2025-03-09 06:53:07,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:07,318 INFO L218 hiAutomatonCegarLoop]: Abstraction has 94 states and 119 transitions. [2025-03-09 06:53:07,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 119 transitions. [2025-03-09 06:53:07,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 76. [2025-03-09 06:53:07,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 75 states have internal predecessors, (101), 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-09 06:53:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2025-03-09 06:53:07,321 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 101 transitions. [2025-03-09 06:53:07,321 INFO L432 stractBuchiCegarLoop]: Abstraction has 76 states and 101 transitions. [2025-03-09 06:53:07,321 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 06:53:07,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 101 transitions. [2025-03-09 06:53:07,322 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2025-03-09 06:53:07,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:07,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:07,322 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:07,322 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 06:53:07,322 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~short8#1, main_#t~mem9#1, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~nondet17#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet5#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1;" "assume main_#t~short8#1;call main_#t~mem7#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0;" "assume main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume !(main_#t~mem9#1 > 0);havoc main_#t~mem9#1;havoc main_#t~nondet14#1;" "assume !(0 != main_#t~nondet14#1);havoc main_#t~nondet14#1;call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#0(main_#t~mem16#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~nondet17#1;call write~int#1(main_#t~nondet17#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet17#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1;" [2025-03-09 06:53:07,322 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~short8#1;call main_#t~mem7#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0;" "assume main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume !(main_#t~mem9#1 > 0);havoc main_#t~mem9#1;havoc main_#t~nondet14#1;" "assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(1 + main_#t~mem15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem15#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1;" [2025-03-09 06:53:07,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:07,323 INFO L85 PathProgramCache]: Analyzing trace with hash -517067838, now seen corresponding path program 1 times [2025-03-09 06:53:07,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:07,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347356590] [2025-03-09 06:53:07,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:07,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:07,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:53:07,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:53:07,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:07,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:07,337 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:07,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:53:07,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:53:07,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:07,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:07,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:07,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:07,350 INFO L85 PathProgramCache]: Analyzing trace with hash 40046000, now seen corresponding path program 2 times [2025-03-09 06:53:07,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:07,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18517354] [2025-03-09 06:53:07,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:53:07,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:07,355 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:53:07,357 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:53:07,357 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:53:07,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:07,357 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:07,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:53:07,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:53:07,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:07,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:07,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:07,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:07,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1471091343, now seen corresponding path program 1 times [2025-03-09 06:53:07,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:07,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834853444] [2025-03-09 06:53:07,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:07,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:07,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:53:07,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:53:07,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:07,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:07,384 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:07,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:53:07,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:53:07,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:07,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:07,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:07,818 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:07,818 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:07,818 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:07,818 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:07,818 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:07,818 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:07,818 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:07,818 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:07,818 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-alloca-2.i_Iteration6_Lasso [2025-03-09 06:53:07,818 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:07,818 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:07,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:07,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:07,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:07,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:07,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:07,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,237 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:08,237 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:08,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:08,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:08,239 INFO L229 MonitoredProcess]: Starting monitored process 43 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-09 06:53:08,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-09 06:53:08,240 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-09 06:53:08,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:08,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:08,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:08,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:08,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:08,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:08,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:08,251 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:08,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-09 06:53:08,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:08,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:08,258 INFO L229 MonitoredProcess]: Starting monitored process 44 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-09 06:53:08,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-09 06:53:08,260 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-09 06:53:08,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:08,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:08,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:08,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:08,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:08,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:08,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:08,271 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:08,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-09 06:53:08,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:08,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:08,278 INFO L229 MonitoredProcess]: Starting monitored process 45 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-09 06:53:08,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-09 06:53:08,280 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-09 06:53:08,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:08,290 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:08,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:08,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:08,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:08,290 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:08,290 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:08,291 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:08,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:08,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:08,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:08,298 INFO L229 MonitoredProcess]: Starting monitored process 46 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-09 06:53:08,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-09 06:53:08,300 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-09 06:53:08,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:08,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:08,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:08,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:08,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:08,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:08,312 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:08,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-03-09 06:53:08,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:08,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:08,319 INFO L229 MonitoredProcess]: Starting monitored process 47 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-09 06:53:08,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-09 06:53:08,321 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-09 06:53:08,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:08,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:08,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:08,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:08,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:08,330 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:08,331 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:08,331 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:08,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-03-09 06:53:08,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:08,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:08,339 INFO L229 MonitoredProcess]: Starting monitored process 48 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-09 06:53:08,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-09 06:53:08,341 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-09 06:53:08,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:08,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:08,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:08,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:08,353 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:08,353 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:08,357 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:08,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:08,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:08,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:08,365 INFO L229 MonitoredProcess]: Starting monitored process 49 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-09 06:53:08,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-09 06:53:08,366 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-09 06:53:08,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:08,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:08,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:08,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:08,378 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:08,378 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:08,383 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:08,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-03-09 06:53:08,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:08,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:08,391 INFO L229 MonitoredProcess]: Starting monitored process 50 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-09 06:53:08,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-09 06:53:08,393 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-09 06:53:08,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:08,402 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-03-09 06:53:08,402 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-03-09 06:53:08,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:08,424 INFO L401 nArgumentSynthesizer]: We have 42 Motzkin's Theorem applications. [2025-03-09 06:53:08,424 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-03-09 06:53:08,450 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:08,465 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-09 06:53:08,465 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-09 06:53:08,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:08,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:08,467 INFO L229 MonitoredProcess]: Starting monitored process 51 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-09 06:53:08,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-09 06:53:08,468 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:08,481 INFO L438 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2025-03-09 06:53:08,481 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:08,481 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_5) = -2*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_5 + 1 Supporting invariants [] [2025-03-09 06:53:08,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:08,509 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2025-03-09 06:53:08,510 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 06:53:08,510 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 06:53:08,510 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x~0!base,]]] [2025-03-09 06:53:08,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:08,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:53:08,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:53:08,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:08,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:08,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:53:08,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:08,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:53:08,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:53:08,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:08,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:08,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:53:08,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:08,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2025-03-09 06:53:08,588 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-09 06:53:08,588 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-09 06:53:08,588 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 101 transitions. cyclomatic complexity: 33 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:08,619 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 101 transitions. cyclomatic complexity: 33. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 101 states and 134 transitions. Complement of second has 9 states. [2025-03-09 06:53:08,620 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-09 06:53:08,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:08,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2025-03-09 06:53:08,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 8 letters. Loop has 5 letters. [2025-03-09 06:53:08,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:08,621 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:08,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:08,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:53:08,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:53:08,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:08,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:08,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:53:08,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:08,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:53:08,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:53:08,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:08,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:08,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:53:08,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:08,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2025-03-09 06:53:08,692 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-09 06:53:08,693 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-09 06:53:08,693 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 101 transitions. cyclomatic complexity: 33 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:08,726 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 101 transitions. cyclomatic complexity: 33. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 104 states and 137 transitions. Complement of second has 11 states. [2025-03-09 06:53:08,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:08,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:08,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2025-03-09 06:53:08,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 8 letters. Loop has 5 letters. [2025-03-09 06:53:08,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:08,727 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:08,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:08,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:53:08,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:53:08,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:08,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:08,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:53:08,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:08,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:53:08,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:53:08,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:08,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:08,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:53:08,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:08,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2025-03-09 06:53:08,789 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-09 06:53:08,790 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-09 06:53:08,790 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 101 transitions. cyclomatic complexity: 33 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:08,813 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 101 transitions. cyclomatic complexity: 33. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 165 states and 220 transitions. Complement of second has 11 states. [2025-03-09 06:53:08,814 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-09 06:53:08,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:08,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2025-03-09 06:53:08,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 8 letters. Loop has 5 letters. [2025-03-09 06:53:08,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:08,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 13 letters. Loop has 5 letters. [2025-03-09 06:53:08,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:08,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 8 letters. Loop has 10 letters. [2025-03-09 06:53:08,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:08,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 220 transitions. [2025-03-09 06:53:08,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2025-03-09 06:53:08,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 126 states and 168 transitions. [2025-03-09 06:53:08,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-03-09 06:53:08,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2025-03-09 06:53:08,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 168 transitions. [2025-03-09 06:53:08,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:08,817 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 168 transitions. [2025-03-09 06:53:08,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 168 transitions. [2025-03-09 06:53:08,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 92. [2025-03-09 06:53:08,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 91 states have internal predecessors, (129), 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-09 06:53:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2025-03-09 06:53:08,825 INFO L240 hiAutomatonCegarLoop]: Abstraction has 92 states and 129 transitions. [2025-03-09 06:53:08,825 INFO L432 stractBuchiCegarLoop]: Abstraction has 92 states and 129 transitions. [2025-03-09 06:53:08,825 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-09 06:53:08,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 129 transitions. [2025-03-09 06:53:08,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2025-03-09 06:53:08,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:08,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:08,826 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:08,826 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1] [2025-03-09 06:53:08,826 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~short8#1, main_#t~mem9#1, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~nondet17#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet5#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1;" "assume main_#t~short8#1;call main_#t~mem7#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0;" "assume main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume main_#t~mem9#1 > 0;havoc main_#t~mem9#1;havoc main_#t~nondet10#1;" "assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~nondet12#1;call write~int#0(main_#t~nondet12#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet12#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1;" "assume main_#t~short8#1;call main_#t~mem7#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0;" "assume main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume !(main_#t~mem9#1 > 0);havoc main_#t~mem9#1;havoc main_#t~nondet14#1;" "assume !(0 != main_#t~nondet14#1);havoc main_#t~nondet14#1;call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#0(main_#t~mem16#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~nondet17#1;call write~int#1(main_#t~nondet17#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet17#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1;" [2025-03-09 06:53:08,826 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~short8#1;call main_#t~mem7#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0;" "assume main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume main_#t~mem9#1 > 0;havoc main_#t~mem9#1;havoc main_#t~nondet10#1;" "assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~nondet12#1;call write~int#0(main_#t~nondet12#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet12#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1;" "assume main_#t~short8#1;call main_#t~mem7#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0;" "assume main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume !(main_#t~mem9#1 > 0);havoc main_#t~mem9#1;havoc main_#t~nondet14#1;" "assume !(0 != main_#t~nondet14#1);havoc main_#t~nondet14#1;call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#0(main_#t~mem16#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~nondet17#1;call write~int#1(main_#t~nondet17#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet17#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1;" [2025-03-09 06:53:08,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:08,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1282580237, now seen corresponding path program 1 times [2025-03-09 06:53:08,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:08,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103510098] [2025-03-09 06:53:08,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:08,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:08,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:53:08,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:53:08,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:08,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:09,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:09,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:53:09,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103510098] [2025-03-09 06:53:09,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103510098] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:53:09,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255445504] [2025-03-09 06:53:09,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:09,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:53:09,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:09,028 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:53:09,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2025-03-09 06:53:09,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:53:09,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:53:09,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:09,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:09,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:53:09,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:09,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-09 06:53:09,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 06:53:09,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:09,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:53:09,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:09,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255445504] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:53:09,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:53:09,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-09 06:53:09,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035219298] [2025-03-09 06:53:09,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:53:09,174 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:53:09,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:09,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1993736928, now seen corresponding path program 1 times [2025-03-09 06:53:09,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:09,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821869844] [2025-03-09 06:53:09,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:09,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:09,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:53:09,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:53:09,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:09,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:09,283 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-09 06:53:09,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:53:09,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821869844] [2025-03-09 06:53:09,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821869844] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:53:09,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711502263] [2025-03-09 06:53:09,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:09,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:53:09,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:09,285 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:53:09,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2025-03-09 06:53:09,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:53:09,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:53:09,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:09,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:09,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:53:09,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:09,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-09 06:53:09,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 06:53:09,380 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-09 06:53:09,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:53:09,420 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-09 06:53:09,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711502263] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:53:09,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:53:09,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-03-09 06:53:09,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958451011] [2025-03-09 06:53:09,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:53:09,421 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:53:09,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:53:09,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 06:53:09,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:53:09,421 INFO L87 Difference]: Start difference. First operand 92 states and 129 transitions. cyclomatic complexity: 43 Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:09,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:53:09,465 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2025-03-09 06:53:09,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 100 transitions. [2025-03-09 06:53:09,465 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 06:53:09,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 0 states and 0 transitions. [2025-03-09 06:53:09,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-09 06:53:09,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-09 06:53:09,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-09 06:53:09,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:53:09,465 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:53:09,465 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:53:09,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 06:53:09,466 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:53:09,466 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-09 06:53:09,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-09 06:53:09,466 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 06:53:09,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-09 06:53:09,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 06:53:09 BoogieIcfgContainer [2025-03-09 06:53:09,473 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 06:53:09,473 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 06:53:09,473 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 06:53:09,473 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 06:53:09,474 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:53:01" (3/4) ... [2025-03-09 06:53:09,475 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 06:53:09,475 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 06:53:09,476 INFO L158 Benchmark]: Toolchain (without parser) took 8794.70ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 124.5MB in the beginning and 134.1MB in the end (delta: -9.6MB). Peak memory consumption was 158.7MB. Max. memory is 16.1GB. [2025-03-09 06:53:09,476 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:53:09,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.50ms. Allocated memory is still 167.8MB. Free memory was 124.5MB in the beginning and 107.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 06:53:09,476 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.94ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 106.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:53:09,476 INFO L158 Benchmark]: Boogie Preprocessor took 21.75ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 105.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:53:09,476 INFO L158 Benchmark]: IcfgBuilder took 197.12ms. Allocated memory is still 167.8MB. Free memory was 105.6MB in the beginning and 93.0MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 06:53:09,477 INFO L158 Benchmark]: BuchiAutomizer took 8323.72ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 93.0MB in the beginning and 134.2MB in the end (delta: -41.2MB). Peak memory consumption was 125.2MB. Max. memory is 16.1GB. [2025-03-09 06:53:09,477 INFO L158 Benchmark]: Witness Printer took 2.24ms. Allocated memory is still 335.5MB. Free memory was 134.2MB in the beginning and 134.1MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:53:09,478 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.21ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.50ms. Allocated memory is still 167.8MB. Free memory was 124.5MB in the beginning and 107.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.94ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 106.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.75ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 105.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 197.12ms. Allocated memory is still 167.8MB. Free memory was 105.6MB in the beginning and 93.0MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 8323.72ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 93.0MB in the beginning and 134.2MB in the end (delta: -41.2MB). Peak memory consumption was 125.2MB. Max. memory is 16.1GB. * Witness Printer took 2.24ms. Allocated memory is still 335.5MB. Free memory was 134.2MB in the beginning and 134.1MB in the end (delta: 106.2kB). 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: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~y~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~y~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (2 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 6 locations. One nondeterministic module has affine ranking function null and consists of 6 locations. One nondeterministic module has affine ranking function null and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.2s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 6.7s. Construction of modules took 0.1s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 74 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, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 139 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 134 mSDsluCounter, 199 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 257 IncrementalHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 107 mSDtfsCounter, 257 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI1 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital190 mio100 ax109 hnf100 lsp90 ukn66 mio100 lsp22 div100 bol106 ite100 ukn100 eq159 hnf92 smp97 dnf175 smp71 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 92ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 3 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 42 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-09 06:53:09,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2025-03-09 06:53:09,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2025-03-09 06:53:09,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-09 06:53:10,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE