./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/TelAviv-Amir-Minimum-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/TelAviv-Amir-Minimum-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 3924410932c0a11a3c37962c46d18333a5b413ea27c689570d00e33ef4d5ae4f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:52:49,512 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:52:49,561 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:49,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:52:49,565 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:52:49,565 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 06:52:49,583 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:52:49,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:52:49,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:52:49,585 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:52:49,586 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:52:49,586 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:52:49,586 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:52:49,586 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:52:49,587 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 06:52:49,587 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 06:52:49,587 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 06:52:49,587 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 06:52:49,587 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 06:52:49,587 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 06:52:49,587 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:52:49,587 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 06:52:49,588 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:52:49,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:52:49,588 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 06:52:49,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 06:52:49,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 06:52:49,588 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:52:49,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:52:49,588 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 06:52:49,588 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:52:49,588 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:52:49,588 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:52:49,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:52:49,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:52:49,589 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:52:49,589 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 06:52:49,589 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 -> 3924410932c0a11a3c37962c46d18333a5b413ea27c689570d00e33ef4d5ae4f [2025-03-09 06:52:49,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:52:49,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:52:49,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:52:49,824 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:52:49,824 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:52:49,826 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/TelAviv-Amir-Minimum-alloca-2.i [2025-03-09 06:52:50,987 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/779b341d1/a53250b989f244dcba16c855ebf96ea3/FLAG4654fe6dc [2025-03-09 06:52:51,231 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:52:51,232 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/TelAviv-Amir-Minimum-alloca-2.i [2025-03-09 06:52:51,248 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/779b341d1/a53250b989f244dcba16c855ebf96ea3/FLAG4654fe6dc [2025-03-09 06:52:51,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/779b341d1/a53250b989f244dcba16c855ebf96ea3 [2025-03-09 06:52:51,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:52:51,555 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:52:51,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:52:51,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:52:51,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:52:51,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:52:51" (1/1) ... [2025-03-09 06:52:51,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36afc31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:51, skipping insertion in model container [2025-03-09 06:52:51,563 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:52:51" (1/1) ... [2025-03-09 06:52:51,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:52:51,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:52:51,786 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:52:51,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:52:51,842 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:52:51,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:51 WrapperNode [2025-03-09 06:52:51,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:52:51,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:52:51,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:52:51,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:52:51,847 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:52:51" (1/1) ... [2025-03-09 06:52:51,854 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:52:51" (1/1) ... [2025-03-09 06:52:51,867 INFO L138 Inliner]: procedures = 110, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2025-03-09 06:52:51,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:52:51,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:52:51,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:52:51,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:52:51,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:51" (1/1) ... [2025-03-09 06:52:51,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:51" (1/1) ... [2025-03-09 06:52:51,874 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:51" (1/1) ... [2025-03-09 06:52:51,881 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [9, 9]. 50 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:52:51,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:51" (1/1) ... [2025-03-09 06:52:51,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:51" (1/1) ... [2025-03-09 06:52:51,885 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:51" (1/1) ... [2025-03-09 06:52:51,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:51" (1/1) ... [2025-03-09 06:52:51,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:51" (1/1) ... [2025-03-09 06:52:51,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:51" (1/1) ... [2025-03-09 06:52:51,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:52:51,888 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:52:51,888 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:52:51,888 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:52:51,889 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:51" (1/1) ... [2025-03-09 06:52:51,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:51,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:51,913 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:52:51,915 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:52:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:52:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:52:51,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:52:51,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:52:51,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 06:52:51,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:52:51,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:52:51,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:52:52,005 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:52:52,006 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:52:52,143 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-09 06:52:52,144 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:52:52,152 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:52:52,154 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:52:52,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:52:52 BoogieIcfgContainer [2025-03-09 06:52:52,154 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:52:52,155 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 06:52:52,155 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 06:52:52,159 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 06:52:52,159 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:52:52,159 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 06:52:51" (1/3) ... [2025-03-09 06:52:52,160 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72d82968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:52:52, skipping insertion in model container [2025-03-09 06:52:52,161 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:52:52,162 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:51" (2/3) ... [2025-03-09 06:52:52,162 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72d82968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:52:52, skipping insertion in model container [2025-03-09 06:52:52,162 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:52:52,162 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:52:52" (3/3) ... [2025-03-09 06:52:52,163 INFO L363 chiAutomizerObserver]: Analyzing ICFG TelAviv-Amir-Minimum-alloca-2.i [2025-03-09 06:52:52,199 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 06:52:52,199 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 06:52:52,200 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 06:52:52,200 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 06:52:52,200 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 06:52:52,200 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 06:52:52,200 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 06:52:52,201 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 06:52:52,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:52:52,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-09 06:52:52,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:52:52,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:52:52,220 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:52:52,220 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:52:52,220 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 06:52:52,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:52:52,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-09 06:52:52,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:52:52,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:52:52,221 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:52:52,221 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:52:52,226 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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:52:52,226 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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#1;" [2025-03-09 06:52:52,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:52,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1568, now seen corresponding path program 1 times [2025-03-09 06:52:52,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:52,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074656422] [2025-03-09 06:52:52,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:52,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:52,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:52:52,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:52:52,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:52,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:52,352 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:52,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:52:52,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:52:52,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:52,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:52,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:52,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:52,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1358895546, now seen corresponding path program 1 times [2025-03-09 06:52:52,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:52,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077958403] [2025-03-09 06:52:52,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:52,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:52,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:52,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:52,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:52,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:52,408 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:52,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:52,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:52,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:52,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:52,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:52,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:52,420 INFO L85 PathProgramCache]: Analyzing trace with hash 507759769, now seen corresponding path program 1 times [2025-03-09 06:52:52,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:52,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129858460] [2025-03-09 06:52:52,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:52,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:52,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:52:52,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:52:52,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:52,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:52,463 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:52,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:52:52,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:52:52,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:52,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:52,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:52,939 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:52:52,939 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:52:52,940 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:52:52,940 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:52:52,940 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:52:52,940 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:52,940 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:52:52,940 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:52:52,940 INFO L132 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca-2.i_Iteration1_Lasso [2025-03-09 06:52:52,940 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:52:52,941 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:52:52,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:52,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:52,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:52,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:52,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:52,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:52,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:52,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:52,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:52,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:52,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:52,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:52,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:52,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:52,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:53,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:53,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:53,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:53,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:53,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:53,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:53,434 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:52:53,437 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:52:53,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:53,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:53,440 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:52:53,442 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:52:53,443 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:52:53,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:53,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:53,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:53,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:53,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:53,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:53,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:53,460 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:53,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-09 06:52:53,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:53,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:53,468 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:52:53,469 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:52:53,470 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:52:53,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:53,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:53,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:53,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:53,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:53,484 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:53,484 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:53,485 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:53,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-09 06:52:53,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:53,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:53,493 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:52:53,494 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:52:53,495 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:52:53,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:53,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:53,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:53,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:53,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:53,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:53,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:53,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:53,513 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:52:53,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:53,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:53,515 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:52:53,516 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:52:53,517 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:52:53,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:53,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:53,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:53,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:53,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:53,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:53,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:53,529 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:53,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:53,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:53,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:53,537 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:52:53,539 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:52:53,540 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:52:53,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:53,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:53,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:53,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:53,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:53,551 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:53,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:53,553 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:53,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:53,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:53,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:53,561 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:52:53,562 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:52:53,564 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:52:53,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:53,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:53,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:53,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:53,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:53,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:53,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:53,576 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:53,582 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:52:53,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:53,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:53,584 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:52:53,586 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:52:53,587 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:52:53,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:53,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:53,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:53,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:53,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:53,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:53,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:53,599 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:53,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:53,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:53,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:53,607 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:52:53,608 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:52:53,609 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:52:53,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:53,619 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:53,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:53,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:53,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:53,620 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:53,620 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:53,621 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:53,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:53,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:53,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:53,628 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:52:53,629 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:52:53,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:53,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:53,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:53,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:53,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:53,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:53,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:53,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:53,643 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:53,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-09 06:52:53,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:53,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:53,652 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:52:53,654 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:52:53,655 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:52:53,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:53,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:53,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:53,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:53,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:53,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:53,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:53,667 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:53,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:53,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:53,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:53,675 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:52:53,677 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:52:53,677 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:52:53,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:53,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:53,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:53,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:53,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:53,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:53,698 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:53,703 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:52:53,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:53,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:53,705 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:52:53,706 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:52:53,707 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:52:53,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:53,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:53,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:53,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:53,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:53,718 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:53,718 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:53,720 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:53,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-09 06:52:53,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:53,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:53,727 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:52:53,728 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:52:53,729 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:52:53,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:53,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:53,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:53,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:53,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:53,739 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:53,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:53,740 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:53,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-09 06:52:53,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:53,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:53,752 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:52:53,753 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:52:53,754 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:52:53,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:53,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:53,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:53,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:53,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:53,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:53,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:53,767 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:53,773 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:52:53,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:53,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:53,775 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:52:53,776 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:52:53,777 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:52:53,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:53,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:53,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:53,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:53,790 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:53,790 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:53,798 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:53,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-09 06:52:53,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:53,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:53,806 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:52:53,807 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:52:53,809 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:52:53,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:53,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:53,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:53,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:53,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:53,819 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:53,819 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:53,821 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:53,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:53,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:53,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:53,828 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:52:53,829 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:52:53,830 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:52:53,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:53,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:53,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:53,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:53,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:53,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:53,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:53,841 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:53,846 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:52:53,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:53,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:53,849 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:52:53,849 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:52:53,851 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:52:53,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:53,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:53,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:53,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:53,864 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:53,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:53,868 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:53,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-09 06:52:53,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:53,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:53,876 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:52:53,876 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:52:53,877 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:52:53,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:53,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:53,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:53,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:53,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:53,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:53,897 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:53,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-09 06:52:53,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:53,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:53,912 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:52:53,913 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:52:53,913 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:52:53,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:53,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:53,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:53,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:53,927 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:53,927 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:53,932 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:53,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-09 06:52:53,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:53,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:53,940 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:52:53,941 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:52:53,943 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:52:53,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:53,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:53,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:53,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:53,959 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:53,959 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:53,964 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:53,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:53,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:53,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:53,973 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:52:53,974 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:52:53,976 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:53,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:53,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:53,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:53,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:53,990 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:53,990 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:53,995 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:54,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:54,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:54,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:54,003 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:52:54,005 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:52:54,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:54,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:54,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:54,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:54,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:54,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:54,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:54,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:54,022 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:52:54,030 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:52:54,033 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 06:52:54,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:54,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:54,036 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:52:54,037 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:52:54,038 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:52:54,038 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:52:54,038 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:52:54,038 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)_1) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_1 Supporting invariants [] [2025-03-09 06:52:54,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-09 06:52:54,067 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-03-09 06:52:54,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 06:52:54,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 06:52:54,071 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:52:54,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:54,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:52:54,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:52:54,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:54,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:54,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:52:54,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:54,121 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:52:54,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:54,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:54,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:54,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:54,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:52:54,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:54,206 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 43 treesize of output 16 [2025-03-09 06:52:54,224 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:52:54,242 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:52:54,243 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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:52:54,309 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). 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 45 states and 61 transitions. Complement of second has 10 states. [2025-03-09 06:52:54,312 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:52:54,314 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:52:54,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2025-03-09 06:52:54,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 2 letters. Loop has 6 letters. [2025-03-09 06:52:54,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:54,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 8 letters. Loop has 6 letters. [2025-03-09 06:52:54,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:54,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 2 letters. Loop has 12 letters. [2025-03-09 06:52:54,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:54,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 61 transitions. [2025-03-09 06:52:54,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-09 06:52:54,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 27 states and 38 transitions. [2025-03-09 06:52:54,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-03-09 06:52:54,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-03-09 06:52:54,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2025-03-09 06:52:54,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:52:54,332 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 38 transitions. [2025-03-09 06:52:54,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2025-03-09 06:52:54,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2025-03-09 06:52:54,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 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:52:54,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2025-03-09 06:52:54,351 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2025-03-09 06:52:54,351 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2025-03-09 06:52:54,351 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 06:52:54,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2025-03-09 06:52:54,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-09 06:52:54,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:52:54,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:52:54,353 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:52:54,354 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:52:54,354 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:52:54,354 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:52:54,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:54,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1448572407, now seen corresponding path program 1 times [2025-03-09 06:52:54,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:54,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772680247] [2025-03-09 06:52:54,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:54,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:54,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:54,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:54,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:54,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:54,421 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:52:54,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:52:54,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772680247] [2025-03-09 06:52:54,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772680247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:52:54,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:52:54,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:52:54,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134466417] [2025-03-09 06:52:54,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:52:54,424 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:52:54,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:54,424 INFO L85 PathProgramCache]: Analyzing trace with hash 975728694, now seen corresponding path program 1 times [2025-03-09 06:52:54,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:54,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95806922] [2025-03-09 06:52:54,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:54,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:54,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:54,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:54,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:54,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:54,441 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:54,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:54,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:54,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:54,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:54,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:54,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:52:54,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:52:54,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:52:54,590 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:52:54,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:52:54,600 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2025-03-09 06:52:54,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2025-03-09 06:52:54,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-09 06:52:54,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 22 states and 28 transitions. [2025-03-09 06:52:54,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-03-09 06:52:54,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-03-09 06:52:54,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2025-03-09 06:52:54,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:52:54,601 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-03-09 06:52:54,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2025-03-09 06:52:54,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-09 06:52:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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:52:54,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2025-03-09 06:52:54,603 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-03-09 06:52:54,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:52:54,604 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-03-09 06:52:54,604 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 06:52:54,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2025-03-09 06:52:54,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-09 06:52:54,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:52:54,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:52:54,605 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:52:54,605 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:52:54,605 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:52:54,605 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:52:54,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:54,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1448571446, now seen corresponding path program 1 times [2025-03-09 06:52:54,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:54,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001726638] [2025-03-09 06:52:54,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:54,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:54,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:54,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:54,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:54,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:54,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:54,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:54,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:54,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:54,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:54,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:54,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:54,631 INFO L85 PathProgramCache]: Analyzing trace with hash 975728694, now seen corresponding path program 2 times [2025-03-09 06:52:54,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:54,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806204517] [2025-03-09 06:52:54,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:52:54,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:54,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:54,642 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:54,642 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:52:54,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:54,644 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:54,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:54,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:54,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:54,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:54,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:54,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:54,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1387485525, now seen corresponding path program 1 times [2025-03-09 06:52:54,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:54,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173328360] [2025-03-09 06:52:54,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:54,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:54,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:52:54,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:52:54,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:54,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:54,668 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:54,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:52:54,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:52:54,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:54,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:54,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:55,089 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:52:55,089 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:52:55,089 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:52:55,089 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:52:55,089 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:52:55,089 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:55,089 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:52:55,089 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:52:55,089 INFO L132 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca-2.i_Iteration3_Lasso [2025-03-09 06:52:55,090 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:52:55,090 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:52:55,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:55,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:55,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:55,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:55,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:55,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:55,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:55,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:55,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:55,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:55,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:55,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:55,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:55,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:55,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:55,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:55,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:55,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:55,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:55,508 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:52:55,508 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:52:55,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:55,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:55,511 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:52:55,512 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:52:55,513 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:52:55,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:55,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:55,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:55,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:55,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:55,522 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:55,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:55,523 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:55,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-09 06:52:55,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:55,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:55,531 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:52:55,532 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:52:55,533 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:52:55,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:55,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:55,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:55,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:55,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:55,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:55,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:55,544 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:55,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-09 06:52:55,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:55,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:55,551 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:52:55,552 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:52:55,553 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:52:55,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:55,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:55,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:55,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:55,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:55,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:55,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:55,564 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:55,569 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:52:55,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:55,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:55,571 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:52:55,571 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:52:55,573 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:52:55,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:55,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:55,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:55,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:55,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:55,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:55,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:55,584 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:55,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-09 06:52:55,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:55,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:55,591 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:52:55,592 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:52:55,593 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:52:55,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:55,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:55,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:55,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:55,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:55,604 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:55,606 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:55,611 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:52:55,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:55,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:55,613 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:52:55,613 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:52:55,614 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:52:55,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:55,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:55,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:55,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:55,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:55,624 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:55,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:55,625 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:55,630 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:52:55,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:55,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:55,632 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:52:55,633 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:52:55,634 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:52:55,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:55,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:55,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:55,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:55,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:55,644 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:55,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:55,645 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:55,650 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:52:55,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:55,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:55,652 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:52:55,653 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:52:55,654 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:52:55,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:55,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:55,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:55,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:55,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:55,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:55,665 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:55,666 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:55,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:55,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:55,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:55,673 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:52:55,674 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:52:55,675 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:52:55,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:55,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:55,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:55,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:55,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:55,685 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:55,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:55,686 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:55,692 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:52:55,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:55,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:55,694 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:52:55,696 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:52:55,698 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:52:55,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:55,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:55,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:55,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:55,713 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:55,713 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:55,721 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:52:55,748 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-03-09 06:52:55,749 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-09 06:52:55,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:55,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:55,751 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:52:55,753 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:52:55,754 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:52:55,764 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2025-03-09 06:52:55,765 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:52:55,765 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 [1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_2 - 1*ULTIMATE.start_main_#t~mem11#1 + 1*ULTIMATE.start_main_#t~mem10#1 >= 0, -1*ULTIMATE.start_main_#t~mem11#1 + 1*ULTIMATE.start_main_#t~mem10#1 - 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_2 + 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~y~0#1.base) 0)_1 >= 0] [2025-03-09 06:52:55,770 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:52:55,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:55,819 INFO L156 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2025-03-09 06:52:55,825 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:52:55,826 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:52:55,826 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:52:55,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:55,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:55,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:55,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:55,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:55,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:52:55,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:55,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:52:55,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:55,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:55,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:55,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:55,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 06:52:55,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:55,935 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 31 treesize of output 23 [2025-03-09 06:52:55,938 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:52:56,008 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:52:56,008 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:52:56,009 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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:52:56,068 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 8. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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 41 states and 53 transitions. Complement of second has 9 states. [2025-03-09 06:52:56,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-09 06:52:56,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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:52:56,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2025-03-09 06:52:56,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 6 letters. Loop has 6 letters. [2025-03-09 06:52:56,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:56,069 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:52:56,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:56,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:56,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:56,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:56,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:56,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:52:56,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:56,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:52:56,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:56,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:56,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:56,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:56,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 06:52:56,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:56,171 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 31 treesize of output 23 [2025-03-09 06:52:56,175 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:52:56,247 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:52:56,247 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:52:56,248 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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:52:56,322 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 8. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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 45 states and 59 transitions. Complement of second has 10 states. [2025-03-09 06:52:56,322 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:52:56,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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:52:56,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2025-03-09 06:52:56,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 6 letters. Loop has 6 letters. [2025-03-09 06:52:56,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:56,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 12 letters. Loop has 6 letters. [2025-03-09 06:52:56,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:56,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 6 letters. Loop has 12 letters. [2025-03-09 06:52:56,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:56,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 59 transitions. [2025-03-09 06:52:56,324 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-03-09 06:52:56,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 43 states and 56 transitions. [2025-03-09 06:52:56,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2025-03-09 06:52:56,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2025-03-09 06:52:56,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 56 transitions. [2025-03-09 06:52:56,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:52:56,326 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 56 transitions. [2025-03-09 06:52:56,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 56 transitions. [2025-03-09 06:52:56,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2025-03-09 06:52:56,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.3) internal successors, (52), 39 states have internal predecessors, (52), 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:52:56,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2025-03-09 06:52:56,329 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 52 transitions. [2025-03-09 06:52:56,329 INFO L432 stractBuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2025-03-09 06:52:56,329 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 06:52:56,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 52 transitions. [2025-03-09 06:52:56,329 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-03-09 06:52:56,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:52:56,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:52:56,330 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:52:56,330 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:52:56,330 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem10#1 < main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#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;" [2025-03-09 06:52:56,330 INFO L754 eck$LassoCheckResult]: Loop: "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" [2025-03-09 06:52:56,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:56,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1956041870, now seen corresponding path program 1 times [2025-03-09 06:52:56,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:56,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881302087] [2025-03-09 06:52:56,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:56,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:56,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:52:56,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:52:56,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:56,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:56,343 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:56,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:52:56,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:52:56,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:56,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:56,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:56,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:56,357 INFO L85 PathProgramCache]: Analyzing trace with hash 959968044, now seen corresponding path program 3 times [2025-03-09 06:52:56,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:56,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701040537] [2025-03-09 06:52:56,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:52:56,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:56,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:56,372 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:56,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:52:56,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:56,377 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:56,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:56,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:56,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:56,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:56,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:56,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:56,384 INFO L85 PathProgramCache]: Analyzing trace with hash 825125369, now seen corresponding path program 1 times [2025-03-09 06:52:56,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:56,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594497917] [2025-03-09 06:52:56,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:56,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:56,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:52:56,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:52:56,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:56,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:56,397 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:56,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:52:56,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:52:56,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:56,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:56,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:56,813 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:52:56,813 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:52:56,813 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:52:56,813 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:52:56,813 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:52:56,814 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:56,814 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:52:56,814 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:52:56,814 INFO L132 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca-2.i_Iteration4_Lasso [2025-03-09 06:52:56,814 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:52:56,814 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:52:56,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:56,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:56,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:56,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:56,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:56,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:56,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:56,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:56,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:56,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:56,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:56,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:56,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:56,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:56,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:56,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:56,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:56,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:56,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:56,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:56,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:57,134 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:52:57,134 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:52:57,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:57,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:57,137 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:52:57,137 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:52:57,140 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:52:57,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:57,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:57,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:57,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:57,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:57,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:57,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:57,151 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:57,156 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:52:57,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:57,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:57,158 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:52:57,159 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:52:57,160 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:52:57,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:57,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:57,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:57,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:57,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:57,171 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:57,173 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:57,178 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:52:57,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:57,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:57,181 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:52:57,182 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:52:57,182 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:52:57,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:57,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:57,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:57,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:57,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:57,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:57,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:57,198 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:57,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-03-09 06:52:57,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:57,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:57,208 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:52:57,210 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:52:57,211 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:52:57,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:57,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:57,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:57,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:57,224 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:57,224 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:57,231 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:57,237 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:52:57,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:57,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:57,239 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:52:57,239 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:52:57,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:52:57,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:57,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:57,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:57,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:57,252 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:57,252 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:57,256 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:52:57,263 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-09 06:52:57,263 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-03-09 06:52:57,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:57,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:57,265 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:52:57,267 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:52:57,267 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:52:57,278 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:52:57,278 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:52:57,279 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)_3) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_3 Supporting invariants [] [2025-03-09 06:52:57,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:57,307 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-03-09 06:52:57,308 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:52:57,308 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:52:57,308 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:52:57,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:57,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:52:57,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:52:57,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:57,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:57,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:52:57,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:57,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:57,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:57,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:57,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:57,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:52:57,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:57,398 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:52:57,399 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:52:57,399 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 52 transitions. cyclomatic complexity: 16 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:52:57,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:57,465 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 52 transitions. cyclomatic complexity: 16. 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 67 states and 88 transitions. Complement of second has 11 states. [2025-03-09 06:52:57,466 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:52:57,466 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:52:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2025-03-09 06:52:57,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 7 letters. Loop has 6 letters. [2025-03-09 06:52:57,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:57,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 13 letters. Loop has 6 letters. [2025-03-09 06:52:57,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:57,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 7 letters. Loop has 12 letters. [2025-03-09 06:52:57,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:57,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 88 transitions. [2025-03-09 06:52:57,468 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2025-03-09 06:52:57,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 85 transitions. [2025-03-09 06:52:57,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2025-03-09 06:52:57,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2025-03-09 06:52:57,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 85 transitions. [2025-03-09 06:52:57,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:52:57,469 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 85 transitions. [2025-03-09 06:52:57,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 85 transitions. [2025-03-09 06:52:57,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2025-03-09 06:52:57,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 61 states have internal predecessors, (81), 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:52:57,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 81 transitions. [2025-03-09 06:52:57,471 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 81 transitions. [2025-03-09 06:52:57,471 INFO L432 stractBuchiCegarLoop]: Abstraction has 62 states and 81 transitions. [2025-03-09 06:52:57,471 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 06:52:57,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 81 transitions. [2025-03-09 06:52:57,472 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2025-03-09 06:52:57,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:52:57,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:52:57,473 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:52:57,473 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:52:57,473 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" [2025-03-09 06:52:57,473 INFO L754 eck$LassoCheckResult]: Loop: "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;" [2025-03-09 06:52:57,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:57,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1956041998, now seen corresponding path program 1 times [2025-03-09 06:52:57,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:57,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642192901] [2025-03-09 06:52:57,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:57,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:57,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:52:57,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:52:57,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:57,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:57,492 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:57,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:52:57,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:52:57,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:57,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:57,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:57,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:57,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1074484776, now seen corresponding path program 2 times [2025-03-09 06:52:57,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:57,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236565390] [2025-03-09 06:52:57,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:52:57,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:57,502 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:57,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:57,509 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:52:57,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:57,509 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:57,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:57,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:57,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:57,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:57,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:57,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:57,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1424003723, now seen corresponding path program 1 times [2025-03-09 06:52:57,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:57,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888075454] [2025-03-09 06:52:57,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:57,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:57,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:52:57,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:52:57,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:57,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:57,533 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:57,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:52:57,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:52:57,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:57,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:57,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:57,959 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:52:57,959 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:52:57,959 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:52:57,959 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:52:57,959 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:52:57,959 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:57,959 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:52:57,959 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:52:57,959 INFO L132 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca-2.i_Iteration5_Lasso [2025-03-09 06:52:57,959 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:52:57,959 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:52:57,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:57,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:57,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:57,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:57,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:58,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:58,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:58,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:58,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:58,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:58,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:58,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:58,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:58,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:58,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:58,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:58,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:58,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:58,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:58,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:58,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:58,281 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:52:58,281 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:52:58,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:58,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:58,289 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:52:58,291 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:52:58,292 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:52:58,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:58,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:58,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:58,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:58,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:58,304 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:58,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:58,305 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:58,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:58,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:58,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:58,313 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:52:58,315 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:52:58,315 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:52:58,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:58,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:58,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:58,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:58,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:58,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:58,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:58,327 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:58,335 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:52:58,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:58,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:58,337 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:52:58,338 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:52:58,339 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:52:58,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:58,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:58,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:58,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:58,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:58,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:58,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:58,350 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:58,355 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:52:58,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:58,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:58,358 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:52:58,359 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:52:58,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:52:58,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:58,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:58,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:58,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:58,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:58,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:58,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:58,373 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:58,379 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:52:58,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:58,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:58,382 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:52:58,383 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:52:58,384 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:52:58,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:58,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:58,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:58,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:58,397 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:58,397 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:58,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:58,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:58,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:58,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:58,422 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:52:58,424 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:52:58,425 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:52:58,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:58,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:58,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:58,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:58,439 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:58,439 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:58,443 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:58,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-03-09 06:52:58,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:58,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:58,451 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:52:58,453 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:52:58,453 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:52:58,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:58,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:58,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:58,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:58,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:58,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:58,470 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:58,476 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:52:58,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:58,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:58,478 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:52:58,479 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:52:58,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:52:58,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:58,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:58,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:58,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:58,491 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:58,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:58,493 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:58,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-03-09 06:52:58,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:58,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:58,503 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:52:58,504 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:52:58,505 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:52:58,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:58,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:58,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:58,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:58,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:58,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:58,523 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:58,529 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:52:58,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:58,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:58,532 INFO L229 MonitoredProcess]: Starting monitored process 52 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:52:58,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-09 06:52:58,534 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:52:58,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:58,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:58,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:58,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:58,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:58,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:58,549 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:52:58,554 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-09 06:52:58,555 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-03-09 06:52:58,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:58,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:58,556 INFO L229 MonitoredProcess]: Starting monitored process 53 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:52:58,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-09 06:52:58,558 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:52:58,568 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:52:58,568 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:52:58,568 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)_4) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_4 Supporting invariants [] [2025-03-09 06:52:58,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-03-09 06:52:58,591 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-03-09 06:52:58,592 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 06:52:58,592 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 06:52:58,592 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:52:58,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:58,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:52:58,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:52:58,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:58,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:58,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:52:58,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:58,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:58,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:58,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:58,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:58,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:52:58,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:58,682 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:52:58,683 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:52:58,683 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 81 transitions. cyclomatic complexity: 26 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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:52:58,719 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 81 transitions. cyclomatic complexity: 26. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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 156 states and 205 transitions. Complement of second has 9 states. [2025-03-09 06:52:58,721 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:52:58,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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:52:58,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2025-03-09 06:52:58,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 7 letters. Loop has 6 letters. [2025-03-09 06:52:58,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:58,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 13 letters. Loop has 6 letters. [2025-03-09 06:52:58,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:58,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 7 letters. Loop has 12 letters. [2025-03-09 06:52:58,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:58,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 205 transitions. [2025-03-09 06:52:58,729 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 50 [2025-03-09 06:52:58,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 148 states and 195 transitions. [2025-03-09 06:52:58,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2025-03-09 06:52:58,730 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2025-03-09 06:52:58,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 195 transitions. [2025-03-09 06:52:58,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:52:58,731 INFO L218 hiAutomatonCegarLoop]: Abstraction has 148 states and 195 transitions. [2025-03-09 06:52:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 195 transitions. [2025-03-09 06:52:58,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 140. [2025-03-09 06:52:58,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 140 states have (on average 1.3) internal successors, (182), 139 states have internal predecessors, (182), 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:52:58,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 182 transitions. [2025-03-09 06:52:58,737 INFO L240 hiAutomatonCegarLoop]: Abstraction has 140 states and 182 transitions. [2025-03-09 06:52:58,738 INFO L432 stractBuchiCegarLoop]: Abstraction has 140 states and 182 transitions. [2025-03-09 06:52:58,738 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 06:52:58,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 182 transitions. [2025-03-09 06:52:58,739 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 50 [2025-03-09 06:52:58,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:52:58,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:52:58,740 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:52:58,740 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:52:58,740 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem10#1 < main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#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;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#1;" [2025-03-09 06:52:58,740 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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem10#1 < main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#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;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#1;" [2025-03-09 06:52:58,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:58,741 INFO L85 PathProgramCache]: Analyzing trace with hash 507755828, now seen corresponding path program 1 times [2025-03-09 06:52:58,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:58,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999483817] [2025-03-09 06:52:58,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:58,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:58,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:52:58,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:52:58,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:58,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:58,752 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:58,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:52:58,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:52:58,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:58,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:58,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:58,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:58,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1358891605, now seen corresponding path program 1 times [2025-03-09 06:52:58,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:58,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200675707] [2025-03-09 06:52:58,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:58,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:58,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:58,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:58,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:58,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:58,766 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:58,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:58,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:58,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:58,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:58,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:58,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:58,772 INFO L85 PathProgramCache]: Analyzing trace with hash -190917304, now seen corresponding path program 2 times [2025-03-09 06:52:58,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:58,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846973395] [2025-03-09 06:52:58,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:52:58,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:58,787 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-09 06:52:58,799 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:52:58,799 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:52:58,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:58,799 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:58,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:52:58,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:52:58,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:58,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:58,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:59,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:59,156 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:52:59,156 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:52:59,156 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:52:59,156 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:52:59,156 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:52:59,156 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:59,156 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:52:59,156 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:52:59,156 INFO L132 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca-2.i_Iteration6_Lasso [2025-03-09 06:52:59,156 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:52:59,156 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:52:59,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:59,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:59,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:59,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:59,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:59,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:59,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:59,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:59,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:59,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:59,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:59,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:59,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:59,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:59,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:59,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:59,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:59,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:59,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:59,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:59,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:59,486 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:52:59,486 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:52:59,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:59,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:59,488 INFO L229 MonitoredProcess]: Starting monitored process 54 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:52:59,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-09 06:52:59,490 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:52:59,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:59,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:59,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:59,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:59,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:59,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:59,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:59,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:59,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-09 06:52:59,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:59,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:59,509 INFO L229 MonitoredProcess]: Starting monitored process 55 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:52:59,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-09 06:52:59,511 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:52:59,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:59,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:59,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:59,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:59,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:59,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:59,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:59,522 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:59,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-03-09 06:52:59,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:59,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:59,529 INFO L229 MonitoredProcess]: Starting monitored process 56 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:52:59,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-09 06:52:59,531 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:52:59,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:59,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:59,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:59,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:59,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:59,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:59,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:59,542 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:59,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-09 06:52:59,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:59,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:59,548 INFO L229 MonitoredProcess]: Starting monitored process 57 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:52:59,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-09 06:52:59,550 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:52:59,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:59,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:59,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:59,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:59,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:59,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:59,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:59,561 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:59,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-09 06:52:59,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:59,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:59,569 INFO L229 MonitoredProcess]: Starting monitored process 58 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:52:59,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-09 06:52:59,570 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:52:59,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:59,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:59,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:59,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:59,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:59,580 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:59,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:59,581 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:59,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-09 06:52:59,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:59,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:59,588 INFO L229 MonitoredProcess]: Starting monitored process 59 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:52:59,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-09 06:52:59,590 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:52:59,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:59,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:59,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:59,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:59,600 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:59,600 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:59,603 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:59,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-09 06:52:59,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:59,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:59,613 INFO L229 MonitoredProcess]: Starting monitored process 60 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:52:59,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-09 06:52:59,616 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:52:59,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:59,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:59,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:59,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:59,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:59,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:59,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:59,627 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:59,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:59,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:59,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:59,634 INFO L229 MonitoredProcess]: Starting monitored process 61 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:52:59,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-09 06:52:59,636 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:52:59,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:59,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:59,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:59,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:59,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:59,647 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:59,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:59,648 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:59,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-03-09 06:52:59,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:59,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:59,655 INFO L229 MonitoredProcess]: Starting monitored process 62 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:52:59,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-09 06:52:59,657 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:52:59,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:59,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:59,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:59,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:59,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:59,668 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:59,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:59,669 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:59,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-03-09 06:52:59,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:59,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:59,676 INFO L229 MonitoredProcess]: Starting monitored process 63 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:52:59,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-09 06:52:59,678 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:52:59,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:59,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:59,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:59,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:59,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:59,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:59,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:59,689 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:59,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-03-09 06:52:59,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:59,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:59,697 INFO L229 MonitoredProcess]: Starting monitored process 64 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:52:59,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-09 06:52:59,698 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:52:59,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:59,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:59,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:59,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:59,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:59,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:59,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:59,710 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:59,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:59,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:59,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:59,717 INFO L229 MonitoredProcess]: Starting monitored process 65 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:52:59,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-09 06:52:59,719 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:52:59,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:59,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:59,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:59,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:59,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:59,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:59,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:59,730 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:59,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-09 06:52:59,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:59,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:59,738 INFO L229 MonitoredProcess]: Starting monitored process 66 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:52:59,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-09 06:52:59,740 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:52:59,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:59,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:59,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:59,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:59,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:59,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:59,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:59,750 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:59,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-03-09 06:52:59,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:59,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:59,758 INFO L229 MonitoredProcess]: Starting monitored process 67 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:52:59,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-09 06:52:59,762 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:52:59,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:59,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:59,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:59,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:59,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:59,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:59,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:59,773 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:59,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-03-09 06:52:59,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:59,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:59,780 INFO L229 MonitoredProcess]: Starting monitored process 68 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:52:59,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-03-09 06:52:59,782 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:52:59,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:59,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:59,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:59,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:59,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:59,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:59,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:59,793 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:59,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-03-09 06:52:59,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:59,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:59,800 INFO L229 MonitoredProcess]: Starting monitored process 69 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:52:59,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-03-09 06:52:59,802 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:52:59,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:59,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:59,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:59,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:59,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:59,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:59,814 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:59,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-03-09 06:52:59,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:59,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:59,822 INFO L229 MonitoredProcess]: Starting monitored process 70 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:52:59,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-03-09 06:52:59,824 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:52:59,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:59,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:59,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:59,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:59,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:59,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:59,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:59,835 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:59,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:59,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:59,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:59,842 INFO L229 MonitoredProcess]: Starting monitored process 71 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:52:59,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-03-09 06:52:59,844 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:52:59,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:59,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:59,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:59,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:59,855 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:59,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:59,858 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:59,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-03-09 06:52:59,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:59,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:59,866 INFO L229 MonitoredProcess]: Starting monitored process 72 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:52:59,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-03-09 06:52:59,867 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:52:59,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:59,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:59,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:59,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:59,879 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:59,879 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:59,884 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:59,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-03-09 06:52:59,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:59,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:59,892 INFO L229 MonitoredProcess]: Starting monitored process 73 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:52:59,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-03-09 06:52:59,893 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:52:59,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:59,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:59,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:59,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:59,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:59,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:59,909 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:59,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:59,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:59,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:59,916 INFO L229 MonitoredProcess]: Starting monitored process 74 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:52:59,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-03-09 06:52:59,919 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:52:59,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:59,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:59,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:59,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:59,930 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:59,930 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:59,933 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:59,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-03-09 06:52:59,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:59,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:59,941 INFO L229 MonitoredProcess]: Starting monitored process 75 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:52:59,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-03-09 06:52:59,943 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:52:59,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:59,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:59,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:59,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:59,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:59,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:59,958 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:59,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-03-09 06:52:59,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:59,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:59,966 INFO L229 MonitoredProcess]: Starting monitored process 76 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:52:59,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-03-09 06:52:59,967 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:52:59,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:59,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:59,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:59,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:59,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:59,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:59,983 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:59,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-03-09 06:52:59,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:59,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:59,991 INFO L229 MonitoredProcess]: Starting monitored process 77 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:52:59,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-03-09 06:52:59,993 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:00,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:00,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:00,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:00,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:00,005 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:00,005 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:00,010 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:00,016 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-09 06:53:00,016 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-09 06:53:00,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:00,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:00,018 INFO L229 MonitoredProcess]: Starting monitored process 78 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,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-03-09 06:53:00,020 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:00,030 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:53:00,030 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:00,030 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)_2) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~y~0#1.base) 0)_2 Supporting invariants [] [2025-03-09 06:53:00,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-03-09 06:53:00,055 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2025-03-09 06:53:00,056 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:53:00,056 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:53:00,056 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:00,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:00,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:53:00,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:53:00,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:00,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:00,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:53:00,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:00,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:53:00,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:53:00,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:00,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:00,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:53:00,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:00,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:00,182 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:00,193 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:00,193 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:00,193 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 140 states and 182 transitions. cyclomatic complexity: 57 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:00,251 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 140 states and 182 transitions. cyclomatic complexity: 57. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 264 states and 336 transitions. Complement of second has 10 states. [2025-03-09 06:53:00,254 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:00,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:00,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2025-03-09 06:53:00,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 8 letters. Loop has 6 letters. [2025-03-09 06:53:00,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:00,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 14 letters. Loop has 6 letters. [2025-03-09 06:53:00,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:00,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 8 letters. Loop has 12 letters. [2025-03-09 06:53:00,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:00,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 264 states and 336 transitions. [2025-03-09 06:53:00,262 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 50 [2025-03-09 06:53:00,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 264 states to 246 states and 316 transitions. [2025-03-09 06:53:00,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2025-03-09 06:53:00,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2025-03-09 06:53:00,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 246 states and 316 transitions. [2025-03-09 06:53:00,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:00,264 INFO L218 hiAutomatonCegarLoop]: Abstraction has 246 states and 316 transitions. [2025-03-09 06:53:00,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states and 316 transitions. [2025-03-09 06:53:00,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 210. [2025-03-09 06:53:00,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 209 states have internal predecessors, (272), 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:00,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 272 transitions. [2025-03-09 06:53:00,279 INFO L240 hiAutomatonCegarLoop]: Abstraction has 210 states and 272 transitions. [2025-03-09 06:53:00,279 INFO L432 stractBuchiCegarLoop]: Abstraction has 210 states and 272 transitions. [2025-03-09 06:53:00,279 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-09 06:53:00,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 272 transitions. [2025-03-09 06:53:00,284 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 50 [2025-03-09 06:53:00,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:00,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:00,284 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:00,284 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:53:00,284 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:00,284 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:00,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:00,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1387485521, now seen corresponding path program 1 times [2025-03-09 06:53:00,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:00,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085792694] [2025-03-09 06:53:00,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:00,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:00,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:53:00,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:53:00,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:00,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:00,297 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:00,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:53:00,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:53:00,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:00,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:00,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:00,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:00,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1093939386, now seen corresponding path program 3 times [2025-03-09 06:53:00,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:00,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825290465] [2025-03-09 06:53:00,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:53:00,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:00,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:53:00,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:53:00,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:53:00,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:00,312 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:00,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:53:00,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:53:00,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:00,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:00,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:00,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:00,317 INFO L85 PathProgramCache]: Analyzing trace with hash 73964776, now seen corresponding path program 1 times [2025-03-09 06:53:00,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:00,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221803913] [2025-03-09 06:53:00,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:00,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:00,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:00,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:00,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:00,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:00,329 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:00,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:00,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:00,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:00,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:00,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:00,743 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:00,743 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:00,743 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:00,743 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:00,743 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:00,743 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:00,743 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:00,743 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:00,743 INFO L132 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca-2.i_Iteration7_Lasso [2025-03-09 06:53:00,743 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:00,743 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:00,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:00,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:00,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:00,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:00,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:00,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:00,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:00,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:00,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:00,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:00,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:00,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:00,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:00,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:00,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:00,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:00,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:00,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:00,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:01,141 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:01,141 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:01,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:01,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:01,143 INFO L229 MonitoredProcess]: Starting monitored process 79 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:01,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-03-09 06:53:01,145 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:01,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:01,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:01,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:01,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:01,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:01,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:01,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:01,156 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:01,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:01,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:01,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:01,164 INFO L229 MonitoredProcess]: Starting monitored process 80 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:01,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-03-09 06:53:01,165 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:01,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:01,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:01,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:01,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:01,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:01,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:01,184 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:01,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-03-09 06:53:01,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:01,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:01,192 INFO L229 MonitoredProcess]: Starting monitored process 81 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:01,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-03-09 06:53:01,193 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:01,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:01,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:01,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:01,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:01,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:01,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:01,209 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:01,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-03-09 06:53:01,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:01,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:01,220 INFO L229 MonitoredProcess]: Starting monitored process 82 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:01,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-03-09 06:53:01,222 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:01,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:01,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:01,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:01,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:01,235 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:01,236 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:01,240 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:01,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-03-09 06:53:01,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:01,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:01,248 INFO L229 MonitoredProcess]: Starting monitored process 83 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:01,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-03-09 06:53:01,249 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:01,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:01,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:01,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:01,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:01,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:01,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:01,275 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:01,284 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-03-09 06:53:01,284 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-09 06:53:01,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:01,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:01,286 INFO L229 MonitoredProcess]: Starting monitored process 84 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:01,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-03-09 06:53:01,288 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:01,298 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:53:01,298 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:01,298 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)_6) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_6 Supporting invariants [] [2025-03-09 06:53:01,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-03-09 06:53:01,322 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2025-03-09 06:53:01,323 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 06:53:01,323 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 06:53:01,323 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:01,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:01,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:53:01,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:53:01,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:01,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:01,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:53:01,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:01,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 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 6 of 6 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 unsat [2025-03-09 06:53:01,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:53:01,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:01,382 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:01,419 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:01,419 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:01,419 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 272 transitions. cyclomatic complexity: 81 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:01,448 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 272 transitions. cyclomatic complexity: 81. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 332 states and 429 transitions. Complement of second has 9 states. [2025-03-09 06:53:01,449 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:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:01,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2025-03-09 06:53:01,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 12 letters. Loop has 6 letters. [2025-03-09 06:53:01,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:01,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 18 letters. Loop has 6 letters. [2025-03-09 06:53:01,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:01,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 12 letters. Loop has 12 letters. [2025-03-09 06:53:01,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:01,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 332 states and 429 transitions. [2025-03-09 06:53:01,452 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 56 [2025-03-09 06:53:01,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 332 states to 306 states and 399 transitions. [2025-03-09 06:53:01,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2025-03-09 06:53:01,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2025-03-09 06:53:01,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 399 transitions. [2025-03-09 06:53:01,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:01,454 INFO L218 hiAutomatonCegarLoop]: Abstraction has 306 states and 399 transitions. [2025-03-09 06:53:01,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 399 transitions. [2025-03-09 06:53:01,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 293. [2025-03-09 06:53:01,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 293 states have (on average 1.2969283276450512) internal successors, (380), 292 states have internal predecessors, (380), 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,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 380 transitions. [2025-03-09 06:53:01,469 INFO L240 hiAutomatonCegarLoop]: Abstraction has 293 states and 380 transitions. [2025-03-09 06:53:01,469 INFO L432 stractBuchiCegarLoop]: Abstraction has 293 states and 380 transitions. [2025-03-09 06:53:01,470 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-09 06:53:01,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 293 states and 380 transitions. [2025-03-09 06:53:01,471 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 56 [2025-03-09 06:53:01,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:01,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:01,471 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1] [2025-03-09 06:53:01,471 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:53:01,472 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" [2025-03-09 06:53:01,472 INFO L754 eck$LassoCheckResult]: Loop: "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;" [2025-03-09 06:53:01,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:01,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1424003722, now seen corresponding path program 1 times [2025-03-09 06:53:01,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:01,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437665250] [2025-03-09 06:53:01,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:01,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:01,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:53:01,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:53:01,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:01,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:01,487 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:01,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:53:01,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:53:01,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:01,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:01,500 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:01,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:01,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1074484776, now seen corresponding path program 4 times [2025-03-09 06:53:01,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:01,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703680746] [2025-03-09 06:53:01,501 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:53:01,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:01,504 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 6 statements into 2 equivalence classes. [2025-03-09 06:53:01,506 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:53:01,507 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:53:01,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:01,507 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:01,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:53:01,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:53:01,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:01,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:01,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:01,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:01,514 INFO L85 PathProgramCache]: Analyzing trace with hash 207493085, now seen corresponding path program 2 times [2025-03-09 06:53:01,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:01,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295978408] [2025-03-09 06:53:01,514 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:53:01,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:01,519 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 06:53:01,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:53:01,527 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:53:01,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:01,527 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:01,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 06:53:01,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:53:01,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:01,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:01,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:01,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-03-09 06:53:02,019 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:02,019 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:02,019 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:02,019 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:02,019 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:02,019 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:02,019 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:02,019 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:02,019 INFO L132 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca-2.i_Iteration8_Lasso [2025-03-09 06:53:02,019 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:02,019 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:02,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:02,302 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:02,302 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:02,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:02,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:02,304 INFO L229 MonitoredProcess]: Starting monitored process 85 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,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-03-09 06:53:02,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:53:02,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:02,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:02,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:02,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:02,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:02,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:02,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:02,316 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:02,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2025-03-09 06:53:02,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:02,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:02,323 INFO L229 MonitoredProcess]: Starting monitored process 86 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,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-03-09 06:53:02,325 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,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:02,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:02,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:02,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:02,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:02,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:02,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:02,336 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:02,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:02,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:02,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:02,343 INFO L229 MonitoredProcess]: Starting monitored process 87 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,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-03-09 06:53:02,344 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,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:02,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:02,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:02,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:02,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:02,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:02,357 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:02,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2025-03-09 06:53:02,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:02,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:02,365 INFO L229 MonitoredProcess]: Starting monitored process 88 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,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-03-09 06:53:02,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:02,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:02,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:02,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:02,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:02,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:02,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:02,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:02,377 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:02,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2025-03-09 06:53:02,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:02,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:02,385 INFO L229 MonitoredProcess]: Starting monitored process 89 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,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-03-09 06:53:02,387 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,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:02,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:02,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:02,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:02,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:02,397 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:02,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:02,398 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:02,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2025-03-09 06:53:02,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:02,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:02,405 INFO L229 MonitoredProcess]: Starting monitored process 90 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,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-03-09 06:53:02,407 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,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:02,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:02,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:02,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:02,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:02,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:02,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:02,418 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:02,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:02,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:02,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:02,425 INFO L229 MonitoredProcess]: Starting monitored process 91 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,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-03-09 06:53:02,427 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,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:02,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:02,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:02,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:02,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:02,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:02,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:02,438 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:02,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:02,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:02,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:02,446 INFO L229 MonitoredProcess]: Starting monitored process 92 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,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-03-09 06:53:02,447 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,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:02,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:02,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:02,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:02,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:02,459 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:02,463 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:02,466 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:53:02,466 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 06:53:02,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:02,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:02,468 INFO L229 MonitoredProcess]: Starting monitored process 93 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,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-03-09 06:53:02,469 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:02,479 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:53:02,480 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:02,480 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)_7) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_7 Supporting invariants [] [2025-03-09 06:53:02,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:02,498 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-03-09 06:53:02,499 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 06:53:02,500 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 06:53:02,500 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,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:02,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:53:02,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:53:02,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:02,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:02,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:53:02,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:02,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:53:02,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:53:02,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:02,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:02,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:53:02,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:02,572 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,572 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,572 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 293 states and 380 transitions. cyclomatic complexity: 113 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:02,612 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 293 states and 380 transitions. cyclomatic complexity: 113. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 368 states and 477 transitions. Complement of second has 9 states. [2025-03-09 06:53:02,612 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:02,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:02,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2025-03-09 06:53:02,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 13 letters. Loop has 6 letters. [2025-03-09 06:53:02,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:02,613 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:02,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:02,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:02,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:53:02,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:53:02,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:02,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:02,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:53:02,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:02,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:53:02,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:53:02,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:02,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:02,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:53:02,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:02,694 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,695 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-09 06:53:02,695 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 293 states and 380 transitions. cyclomatic complexity: 113 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:02,726 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 293 states and 380 transitions. cyclomatic complexity: 113. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 368 states and 477 transitions. Complement of second has 9 states. [2025-03-09 06:53:02,726 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:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:02,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2025-03-09 06:53:02,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 13 letters. Loop has 6 letters. [2025-03-09 06:53:02,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:02,727 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:02,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:02,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:53:02,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:53:02,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:02,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:02,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:53:02,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:02,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:53:02,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:53:02,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:02,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:02,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:53:02,771 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,801 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-09 06:53:02,801 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 293 states and 380 transitions. cyclomatic complexity: 113 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:02,825 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 293 states and 380 transitions. cyclomatic complexity: 113. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 395 states and 511 transitions. Complement of second has 8 states. [2025-03-09 06:53:02,826 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:02,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:02,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2025-03-09 06:53:02,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 13 letters. Loop has 6 letters. [2025-03-09 06:53:02,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:02,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 19 letters. Loop has 6 letters. [2025-03-09 06:53:02,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:02,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 13 letters. Loop has 12 letters. [2025-03-09 06:53:02,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:02,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 395 states and 511 transitions. [2025-03-09 06:53:02,829 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 90 [2025-03-09 06:53:02,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 395 states to 350 states and 450 transitions. [2025-03-09 06:53:02,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 161 [2025-03-09 06:53:02,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2025-03-09 06:53:02,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 350 states and 450 transitions. [2025-03-09 06:53:02,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:02,835 INFO L218 hiAutomatonCegarLoop]: Abstraction has 350 states and 450 transitions. [2025-03-09 06:53:02,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states and 450 transitions. [2025-03-09 06:53:02,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 195. [2025-03-09 06:53:02,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 195 states have (on average 1.2923076923076924) internal successors, (252), 194 states have internal predecessors, (252), 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,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 252 transitions. [2025-03-09 06:53:02,843 INFO L240 hiAutomatonCegarLoop]: Abstraction has 195 states and 252 transitions. [2025-03-09 06:53:02,843 INFO L432 stractBuchiCegarLoop]: Abstraction has 195 states and 252 transitions. [2025-03-09 06:53:02,843 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-09 06:53:02,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states and 252 transitions. [2025-03-09 06:53:02,844 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 64 [2025-03-09 06:53:02,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:02,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:02,844 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:02,844 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:53:02,845 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#1;" [2025-03-09 06:53:02,845 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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#1;" [2025-03-09 06:53:02,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:02,845 INFO L85 PathProgramCache]: Analyzing trace with hash 507759800, now seen corresponding path program 2 times [2025-03-09 06:53:02,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:02,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737949044] [2025-03-09 06:53:02,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:53:02,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:02,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:53:02,853 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:53:02,853 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:53:02,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:02,853 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:02,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:53:02,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:53:02,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:02,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:02,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:02,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:02,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1358895577, now seen corresponding path program 1 times [2025-03-09 06:53:02,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:02,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121036760] [2025-03-09 06:53:02,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:02,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:02,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:53:02,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:53:02,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:02,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:02,868 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:02,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:53:02,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:53:02,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:02,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:02,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:02,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:02,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1194442416, now seen corresponding path program 3 times [2025-03-09 06:53:02,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:02,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270289497] [2025-03-09 06:53:02,874 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:53:02,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:02,880 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-03-09 06:53:02,886 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:53:02,886 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 06:53:02,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:02,886 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:02,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:53:02,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:53:02,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:02,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:02,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:03,176 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:03,176 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:03,176 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:03,177 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:03,177 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:03,177 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:03,177 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:03,177 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:03,177 INFO L132 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca-2.i_Iteration9_Lasso [2025-03-09 06:53:03,177 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:03,177 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:03,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:03,506 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:03,506 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:03,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:03,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:03,508 INFO L229 MonitoredProcess]: Starting monitored process 94 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,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-03-09 06:53:03,510 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,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:03,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:03,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:03,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:03,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:03,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:03,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:03,520 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:03,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2025-03-09 06:53:03,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:03,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:03,528 INFO L229 MonitoredProcess]: Starting monitored process 95 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,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2025-03-09 06:53:03,530 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,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:03,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:03,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:03,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:03,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:03,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:03,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:03,541 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:03,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2025-03-09 06:53:03,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:03,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:03,548 INFO L229 MonitoredProcess]: Starting monitored process 96 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,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2025-03-09 06:53:03,550 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,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:03,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:03,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:03,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:03,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:03,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:03,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:03,561 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:03,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2025-03-09 06:53:03,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:03,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:03,568 INFO L229 MonitoredProcess]: Starting monitored process 97 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,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2025-03-09 06:53:03,570 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,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:03,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:03,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:03,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:03,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:03,580 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:03,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:03,581 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:03,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2025-03-09 06:53:03,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:03,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:03,589 INFO L229 MonitoredProcess]: Starting monitored process 98 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,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2025-03-09 06:53:03,590 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,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:03,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:03,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:03,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:03,602 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:03,602 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:03,607 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:03,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2025-03-09 06:53:03,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:03,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:03,615 INFO L229 MonitoredProcess]: Starting monitored process 99 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,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2025-03-09 06:53:03,617 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,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:03,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:03,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:03,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:03,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:03,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:03,632 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:03,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2025-03-09 06:53:03,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:03,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:03,640 INFO L229 MonitoredProcess]: Starting monitored process 100 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,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2025-03-09 06:53:03,642 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,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:03,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:03,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:03,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:03,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:03,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:03,655 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:03,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:03,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:03,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:03,663 INFO L229 MonitoredProcess]: Starting monitored process 101 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,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2025-03-09 06:53:03,665 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,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:03,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:03,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:03,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:03,677 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:03,677 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:03,681 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:03,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2025-03-09 06:53:03,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:03,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:03,689 INFO L229 MonitoredProcess]: Starting monitored process 102 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,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2025-03-09 06:53:03,691 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,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:03,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:03,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:03,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:03,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:03,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:03,707 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:03,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2025-03-09 06:53:03,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:03,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:03,715 INFO L229 MonitoredProcess]: Starting monitored process 103 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,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2025-03-09 06:53:03,717 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,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:03,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:03,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:03,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:03,730 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:03,730 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:03,736 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:03,747 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-09 06:53:03,748 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-09 06:53:03,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:03,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:03,750 INFO L229 MonitoredProcess]: Starting monitored process 104 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,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2025-03-09 06:53:03,751 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:03,762 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:53:03,762 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:03,762 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:03,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2025-03-09 06:53:03,793 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2025-03-09 06:53:03,795 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 06:53:03,795 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 06:53:03,795 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:03,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:03,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:53:03,827 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,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:03,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:03,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:53:03,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:03,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:53:03,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:53:03,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:03,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:03,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 06:53:03,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:03,913 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 25 treesize of output 17 [2025-03-09 06:53:03,916 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 43 treesize of output 16 [2025-03-09 06:53:03,927 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:03,927 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2025-03-09 06:53:03,927 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 195 states and 252 transitions. cyclomatic complexity: 72 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:03,995 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 195 states and 252 transitions. cyclomatic complexity: 72. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 323 states and 420 transitions. Complement of second has 12 states. [2025-03-09 06:53:03,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:03,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:03,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2025-03-09 06:53:03,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 8 letters. Loop has 6 letters. [2025-03-09 06:53:03,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:03,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 14 letters. Loop has 6 letters. [2025-03-09 06:53:03,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:03,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 8 letters. Loop has 12 letters. [2025-03-09 06:53:03,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:03,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 323 states and 420 transitions. [2025-03-09 06:53:04,000 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 52 [2025-03-09 06:53:04,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 323 states to 289 states and 374 transitions. [2025-03-09 06:53:04,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2025-03-09 06:53:04,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2025-03-09 06:53:04,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 289 states and 374 transitions. [2025-03-09 06:53:04,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:04,002 INFO L218 hiAutomatonCegarLoop]: Abstraction has 289 states and 374 transitions. [2025-03-09 06:53:04,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states and 374 transitions. [2025-03-09 06:53:04,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 265. [2025-03-09 06:53:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 265 states have (on average 1.2867924528301886) internal successors, (341), 264 states have internal predecessors, (341), 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,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 341 transitions. [2025-03-09 06:53:04,005 INFO L240 hiAutomatonCegarLoop]: Abstraction has 265 states and 341 transitions. [2025-03-09 06:53:04,005 INFO L432 stractBuchiCegarLoop]: Abstraction has 265 states and 341 transitions. [2025-03-09 06:53:04,005 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-09 06:53:04,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 265 states and 341 transitions. [2025-03-09 06:53:04,006 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 52 [2025-03-09 06:53:04,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:04,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:04,007 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-09 06:53:04,007 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:53:04,007 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem10#1 < main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#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;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#1;" [2025-03-09 06:53:04,007 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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem10#1 < main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#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;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#1;" [2025-03-09 06:53:04,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:04,008 INFO L85 PathProgramCache]: Analyzing trace with hash -190917335, now seen corresponding path program 2 times [2025-03-09 06:53:04,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:04,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83327381] [2025-03-09 06:53:04,008 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:53:04,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:04,014 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-09 06:53:04,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:53:04,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:53:04,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:04,019 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:04,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:53:04,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:53:04,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:04,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:04,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:04,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:04,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1358891605, now seen corresponding path program 2 times [2025-03-09 06:53:04,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:04,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402081361] [2025-03-09 06:53:04,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:53:04,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:04,030 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:53:04,032 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:53:04,032 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:53:04,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:04,032 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:04,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:53:04,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:53:04,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:04,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:04,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:04,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:04,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1436327555, now seen corresponding path program 3 times [2025-03-09 06:53:04,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:04,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860118259] [2025-03-09 06:53:04,036 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:53:04,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:04,043 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-03-09 06:53:04,050 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:53:04,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 06:53:04,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:04,051 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:04,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 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 20 of 20 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 sat [2025-03-09 06:53:04,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:04,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:04,776 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:04,777 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:04,777 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:04,777 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:04,777 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:04,777 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:04,777 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:04,777 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:04,777 INFO L132 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca-2.i_Iteration10_Lasso [2025-03-09 06:53:04,777 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:04,777 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:04,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:04,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:05,023 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:05,023 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:05,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:05,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:05,025 INFO L229 MonitoredProcess]: Starting monitored process 105 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,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2025-03-09 06:53:05,027 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,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:05,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:05,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:05,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:05,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:05,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:05,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:05,038 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:05,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2025-03-09 06:53:05,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:05,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:05,045 INFO L229 MonitoredProcess]: Starting monitored process 106 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,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2025-03-09 06:53:05,047 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,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:05,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:05,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:05,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:05,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:05,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:05,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:05,058 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:05,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2025-03-09 06:53:05,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:05,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:05,066 INFO L229 MonitoredProcess]: Starting monitored process 107 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,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2025-03-09 06:53:05,068 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,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:05,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:05,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:05,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:05,079 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:05,079 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:05,083 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:05,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2025-03-09 06:53:05,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:05,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:05,091 INFO L229 MonitoredProcess]: Starting monitored process 108 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,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2025-03-09 06:53:05,093 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,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:05,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:05,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:05,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:05,104 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:05,104 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:05,108 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:05,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:05,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:05,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:05,115 INFO L229 MonitoredProcess]: Starting monitored process 109 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,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2025-03-09 06:53:05,116 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,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:05,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:05,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:05,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:05,128 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:05,128 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:05,132 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:05,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2025-03-09 06:53:05,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:05,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:05,139 INFO L229 MonitoredProcess]: Starting monitored process 110 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,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2025-03-09 06:53:05,141 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,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:05,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:05,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:05,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:05,152 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:05,152 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:05,156 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:05,162 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-09 06:53:05,162 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-03-09 06:53:05,162 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,164 INFO L229 MonitoredProcess]: Starting monitored process 111 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 (111)] Waiting until timeout for monitored process [2025-03-09 06:53:05,167 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:05,178 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:53:05,178 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:05,178 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)_9) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_9 Supporting invariants [] [2025-03-09 06:53:05,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2025-03-09 06:53:05,203 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-03-09 06:53:05,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:53:05,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:53:05,204 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:05,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:05,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:53:05,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:53:05,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:05,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:05,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:53:05,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:05,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:53:05,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:53:05,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:05,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:05,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 06:53:05,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:05,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:05,315 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:05,328 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,329 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:05,329 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 265 states and 341 transitions. cyclomatic complexity: 96 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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:05,357 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 265 states and 341 transitions. cyclomatic complexity: 96. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) Result 389 states and 493 transitions. Complement of second has 9 states. [2025-03-09 06:53:05,360 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:05,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2025-03-09 06:53:05,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 14 letters. Loop has 6 letters. [2025-03-09 06:53:05,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:05,360 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:05,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:05,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:53:05,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:53:05,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:05,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:05,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:53:05,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:05,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:53:05,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:53:05,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:05,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:05,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 06:53:05,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:05,452 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:05,461 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,461 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:05,461 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 265 states and 341 transitions. cyclomatic complexity: 96 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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:05,493 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 265 states and 341 transitions. cyclomatic complexity: 96. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) Result 383 states and 479 transitions. Complement of second has 11 states. [2025-03-09 06:53:05,493 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,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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:05,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2025-03-09 06:53:05,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 14 letters. Loop has 6 letters. [2025-03-09 06:53:05,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:05,494 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:05,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:05,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:53:05,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:53:05,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:05,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:05,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:53:05,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:05,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:53:05,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:53:05,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:05,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:05,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 06:53:05,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:05,579 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:05,590 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,591 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:05,591 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 265 states and 341 transitions. cyclomatic complexity: 96 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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:05,626 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 265 states and 341 transitions. cyclomatic complexity: 96. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) Result 445 states and 568 transitions. Complement of second has 10 states. [2025-03-09 06:53:05,627 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:05,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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:05,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2025-03-09 06:53:05,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 14 letters. Loop has 6 letters. [2025-03-09 06:53:05,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:05,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 20 letters. Loop has 6 letters. [2025-03-09 06:53:05,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:05,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 14 letters. Loop has 12 letters. [2025-03-09 06:53:05,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:05,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 445 states and 568 transitions. [2025-03-09 06:53:05,633 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 64 [2025-03-09 06:53:05,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 445 states to 357 states and 458 transitions. [2025-03-09 06:53:05,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 105 [2025-03-09 06:53:05,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2025-03-09 06:53:05,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 357 states and 458 transitions. [2025-03-09 06:53:05,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:05,635 INFO L218 hiAutomatonCegarLoop]: Abstraction has 357 states and 458 transitions. [2025-03-09 06:53:05,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states and 458 transitions. [2025-03-09 06:53:05,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 259. [2025-03-09 06:53:05,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 259 states have (on average 1.305019305019305) internal successors, (338), 258 states have internal predecessors, (338), 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,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 338 transitions. [2025-03-09 06:53:05,639 INFO L240 hiAutomatonCegarLoop]: Abstraction has 259 states and 338 transitions. [2025-03-09 06:53:05,639 INFO L432 stractBuchiCegarLoop]: Abstraction has 259 states and 338 transitions. [2025-03-09 06:53:05,639 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-09 06:53:05,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 259 states and 338 transitions. [2025-03-09 06:53:05,640 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2025-03-09 06:53:05,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:05,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:05,640 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:05,640 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:05,640 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:05,640 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:05,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:05,641 INFO L85 PathProgramCache]: Analyzing trace with hash 73964772, now seen corresponding path program 2 times [2025-03-09 06:53:05,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:05,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662570937] [2025-03-09 06:53:05,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:53:05,641 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 18 statements into 2 equivalence classes. [2025-03-09 06:53:05,653 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:05,653 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:53:05,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:05,653 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:05,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:05,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:05,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:05,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:05,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:05,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:05,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1069503794, now seen corresponding path program 1 times [2025-03-09 06:53:05,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:05,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888151088] [2025-03-09 06:53:05,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:05,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:05,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:53:05,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:53:05,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:05,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:05,670 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:05,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:53:05,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:53:05,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:05,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:05,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:05,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:05,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1093792975, now seen corresponding path program 1 times [2025-03-09 06:53:05,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:05,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28661294] [2025-03-09 06:53:05,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:05,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:05,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:53:05,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:53:05,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:05,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:05,694 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:05,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:53:05,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:53:05,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:05,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:05,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:06,659 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:06,660 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:06,660 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:06,660 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:06,660 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:06,660 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:06,660 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:06,660 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:06,660 INFO L132 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca-2.i_Iteration11_Lasso [2025-03-09 06:53:06,660 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:06,660 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:06,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:06,941 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:06,941 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:06,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:06,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:06,943 INFO L229 MonitoredProcess]: Starting monitored process 112 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,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2025-03-09 06:53:06,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:06,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:06,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:06,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:06,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:06,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:06,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:06,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:06,955 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:06,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2025-03-09 06:53:06,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:06,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:06,963 INFO L229 MonitoredProcess]: Starting monitored process 113 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,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2025-03-09 06:53:06,964 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,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:06,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:06,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:06,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:06,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:06,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:06,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:06,976 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:06,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2025-03-09 06:53:06,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:06,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:06,983 INFO L229 MonitoredProcess]: Starting monitored process 114 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,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2025-03-09 06:53:06,984 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,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:06,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:06,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:06,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:06,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:06,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:06,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:06,995 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:07,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2025-03-09 06:53:07,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:07,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:07,003 INFO L229 MonitoredProcess]: Starting monitored process 115 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:07,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2025-03-09 06:53:07,004 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:07,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:07,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:07,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:07,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:07,015 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:07,015 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:07,017 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:07,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2025-03-09 06:53:07,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:07,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:07,024 INFO L229 MonitoredProcess]: Starting monitored process 116 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:07,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2025-03-09 06:53:07,026 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:07,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:07,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:07,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:07,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:07,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:07,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:07,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:07,037 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:07,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2025-03-09 06:53:07,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:07,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:07,045 INFO L229 MonitoredProcess]: Starting monitored process 117 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:07,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2025-03-09 06:53:07,047 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:07,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:07,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:07,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:07,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:07,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:07,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:07,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:07,058 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:07,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2025-03-09 06:53:07,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:07,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:07,065 INFO L229 MonitoredProcess]: Starting monitored process 118 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:07,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2025-03-09 06:53:07,067 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:07,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:07,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:07,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:07,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:07,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:07,077 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:07,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:07,078 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:07,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2025-03-09 06:53:07,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:07,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:07,085 INFO L229 MonitoredProcess]: Starting monitored process 119 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:07,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2025-03-09 06:53:07,087 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:07,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:07,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:07,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:07,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:07,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:07,097 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:07,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:07,098 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:07,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2025-03-09 06:53:07,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:07,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:07,105 INFO L229 MonitoredProcess]: Starting monitored process 120 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:07,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2025-03-09 06:53:07,107 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:07,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:07,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:07,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:07,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:07,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:07,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:07,121 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:07,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:07,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:07,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:07,128 INFO L229 MonitoredProcess]: Starting monitored process 121 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:07,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2025-03-09 06:53:07,130 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:07,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:07,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:07,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:07,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:07,141 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:07,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:07,145 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:07,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:07,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:07,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:07,152 INFO L229 MonitoredProcess]: Starting monitored process 122 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:07,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2025-03-09 06:53:07,154 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:07,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:07,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:07,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:07,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:07,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:07,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:07,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:07,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2025-03-09 06:53:07,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:07,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:07,178 INFO L229 MonitoredProcess]: Starting monitored process 123 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:07,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2025-03-09 06:53:07,179 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:07,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:07,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:07,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:07,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:07,191 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:07,191 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:07,195 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:07,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:07,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:07,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:07,203 INFO L229 MonitoredProcess]: Starting monitored process 124 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:07,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2025-03-09 06:53:07,205 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:07,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:07,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:07,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:07,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:07,218 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:07,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:07,225 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:07,231 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-09 06:53:07,231 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-03-09 06:53:07,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:07,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:07,234 INFO L229 MonitoredProcess]: Starting monitored process 125 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:07,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2025-03-09 06:53:07,235 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:07,245 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:53:07,245 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:07,245 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)_10) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_10 Supporting invariants [] [2025-03-09 06:53:07,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2025-03-09 06:53:07,265 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-03-09 06:53:07,266 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 06:53:07,266 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 06:53:07,266 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:07,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:07,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:07,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:07,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:07,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:07,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:53:07,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:07,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:53:07,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:53:07,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:07,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:07,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:53:07,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:07,328 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 25 treesize of output 17 [2025-03-09 06:53:07,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:07,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:07,349 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 23 treesize of output 15 [2025-03-09 06:53:07,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:07,394 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-03-09 06:53:07,394 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 259 states and 338 transitions. cyclomatic complexity: 95 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:07,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:07,500 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 259 states and 338 transitions. cyclomatic complexity: 95. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 631 states and 774 transitions. Complement of second has 15 states. [2025-03-09 06:53:07,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:07,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:07,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2025-03-09 06:53:07,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 18 letters. Loop has 12 letters. [2025-03-09 06:53:07,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:07,502 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:07,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:07,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:07,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:07,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:07,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:07,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:53:07,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:07,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:53:07,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:53:07,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:07,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:07,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:53:07,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:07,578 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 25 treesize of output 17 [2025-03-09 06:53:07,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:07,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:07,598 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 23 treesize of output 15 [2025-03-09 06:53:07,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:07,635 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2025-03-09 06:53:07,635 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 259 states and 338 transitions. cyclomatic complexity: 95 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:07,718 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 259 states and 338 transitions. cyclomatic complexity: 95. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 576 states and 714 transitions. Complement of second has 17 states. [2025-03-09 06:53:07,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:07,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2025-03-09 06:53:07,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 30 transitions. Stem has 18 letters. Loop has 12 letters. [2025-03-09 06:53:07,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:07,719 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:07,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:07,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:07,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:07,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:07,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:07,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:53:07,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:07,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:53:07,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:53:07,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:07,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:07,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:53:07,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:07,782 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 25 treesize of output 17 [2025-03-09 06:53:07,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:07,800 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 23 treesize of output 15 [2025-03-09 06:53:07,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:07,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:07,852 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 5 loop predicates [2025-03-09 06:53:07,852 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 259 states and 338 transitions. cyclomatic complexity: 95 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:07,939 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 259 states and 338 transitions. cyclomatic complexity: 95. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 660 states and 820 transitions. Complement of second has 21 states. [2025-03-09 06:53:07,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:07,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:07,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2025-03-09 06:53:07,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 18 letters. Loop has 12 letters. [2025-03-09 06:53:07,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:07,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 30 letters. Loop has 12 letters. [2025-03-09 06:53:07,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:07,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 18 letters. Loop has 24 letters. [2025-03-09 06:53:07,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:07,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 820 transitions. [2025-03-09 06:53:07,945 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 157 [2025-03-09 06:53:07,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 541 states and 684 transitions. [2025-03-09 06:53:07,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2025-03-09 06:53:07,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2025-03-09 06:53:07,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 541 states and 684 transitions. [2025-03-09 06:53:07,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:07,948 INFO L218 hiAutomatonCegarLoop]: Abstraction has 541 states and 684 transitions. [2025-03-09 06:53:07,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states and 684 transitions. [2025-03-09 06:53:07,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 430. [2025-03-09 06:53:07,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 430 states have (on average 1.2813953488372094) internal successors, (551), 429 states have internal predecessors, (551), 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,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 551 transitions. [2025-03-09 06:53:07,956 INFO L240 hiAutomatonCegarLoop]: Abstraction has 430 states and 551 transitions. [2025-03-09 06:53:07,956 INFO L432 stractBuchiCegarLoop]: Abstraction has 430 states and 551 transitions. [2025-03-09 06:53:07,956 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-09 06:53:07,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 430 states and 551 transitions. [2025-03-09 06:53:07,958 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 148 [2025-03-09 06:53:07,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:07,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:07,959 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:07,959 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:07,959 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:07,959 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:07,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:07,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1445554664, now seen corresponding path program 3 times [2025-03-09 06:53:07,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:07,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608200703] [2025-03-09 06:53:07,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:53:07,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:07,967 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-03-09 06:53:07,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:07,973 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 06:53:07,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:07,974 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:07,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:07,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:07,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:07,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:07,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:07,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:07,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1447068975, now seen corresponding path program 1 times [2025-03-09 06:53:07,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:07,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079478368] [2025-03-09 06:53:07,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:07,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:07,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:53:07,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:53:07,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:07,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:07,991 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:07,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:53:07,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:53:07,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:07,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:07,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:07,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:07,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1395700586, now seen corresponding path program 4 times [2025-03-09 06:53:07,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:07,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672009144] [2025-03-09 06:53:07,997 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:53:07,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:08,004 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-09 06:53:08,012 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:53:08,012 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:53:08,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:08,012 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:08,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:53:08,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:53:08,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:08,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:08,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:08,842 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:08,842 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:08,842 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:08,842 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:08,842 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:08,842 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:08,842 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:08,842 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:08,842 INFO L132 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca-2.i_Iteration12_Lasso [2025-03-09 06:53:08,842 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:08,842 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:08,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:08,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:09,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:09,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:09,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:09,165 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:09,165 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:09,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:09,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:09,167 INFO L229 MonitoredProcess]: Starting monitored process 126 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:09,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2025-03-09 06:53:09,170 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:09,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:09,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:09,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:09,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:09,180 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:09,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:09,183 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:09,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:09,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:09,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:09,191 INFO L229 MonitoredProcess]: Starting monitored process 127 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:09,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2025-03-09 06:53:09,193 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:09,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:09,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:09,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:09,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:09,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:09,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:09,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:09,204 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:09,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:09,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:09,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:09,212 INFO L229 MonitoredProcess]: Starting monitored process 128 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:09,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2025-03-09 06:53:09,215 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:09,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:09,225 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:09,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:09,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:09,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:09,225 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:09,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:09,226 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:09,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2025-03-09 06:53:09,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:09,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:09,234 INFO L229 MonitoredProcess]: Starting monitored process 129 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:09,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2025-03-09 06:53:09,237 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:09,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:09,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:09,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:09,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:09,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:09,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:09,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:09,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:09,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:09,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:09,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:09,263 INFO L229 MonitoredProcess]: Starting monitored process 130 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:09,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2025-03-09 06:53:09,266 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:09,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:09,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:09,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:09,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:09,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:09,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:09,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:09,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:09,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2025-03-09 06:53:09,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:09,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:09,286 INFO L229 MonitoredProcess]: Starting monitored process 131 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:09,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2025-03-09 06:53:09,288 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:09,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:09,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:09,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:09,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:09,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:09,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:09,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:09,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:09,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:09,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:09,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:09,308 INFO L229 MonitoredProcess]: Starting monitored process 132 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:09,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2025-03-09 06:53:09,311 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:09,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:09,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:09,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:09,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:09,321 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:09,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:09,323 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:09,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2025-03-09 06:53:09,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:09,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:09,332 INFO L229 MonitoredProcess]: Starting monitored process 133 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:09,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2025-03-09 06:53:09,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:09,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:09,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:09,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:09,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:09,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:09,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:09,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:09,346 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:09,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:09,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:09,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:09,367 INFO L229 MonitoredProcess]: Starting monitored process 134 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:09,390 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:09,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2025-03-09 06:53:09,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:09,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:09,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:09,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:09,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:09,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:09,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:09,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:09,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2025-03-09 06:53:09,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:09,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:09,412 INFO L229 MonitoredProcess]: Starting monitored process 135 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:09,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2025-03-09 06:53:09,415 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:09,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:09,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:09,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:09,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:09,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:09,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:09,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:09,426 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:09,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:09,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:09,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:09,434 INFO L229 MonitoredProcess]: Starting monitored process 136 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:09,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2025-03-09 06:53:09,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:53:09,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:09,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:09,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:09,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:09,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:09,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:09,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:09,452 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:09,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:09,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:09,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:09,460 INFO L229 MonitoredProcess]: Starting monitored process 137 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:09,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2025-03-09 06:53:09,461 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:09,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:09,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:09,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:09,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:09,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:09,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:09,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:09,472 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:09,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2025-03-09 06:53:09,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:09,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:09,480 INFO L229 MonitoredProcess]: Starting monitored process 138 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:09,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2025-03-09 06:53:09,482 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:09,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:09,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:09,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:09,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:09,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:09,492 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:09,492 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:09,493 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:09,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2025-03-09 06:53:09,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:09,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:09,500 INFO L229 MonitoredProcess]: Starting monitored process 139 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:09,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2025-03-09 06:53:09,502 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:09,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:09,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:09,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:09,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:09,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:09,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:09,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:09,513 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:09,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2025-03-09 06:53:09,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:09,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:09,520 INFO L229 MonitoredProcess]: Starting monitored process 140 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:09,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2025-03-09 06:53:09,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:09,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:09,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:09,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:09,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:09,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:09,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:09,536 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:09,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2025-03-09 06:53:09,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:09,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:09,543 INFO L229 MonitoredProcess]: Starting monitored process 141 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:09,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2025-03-09 06:53:09,545 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:09,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:09,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:09,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:09,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:09,558 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:09,558 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:09,562 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:09,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2025-03-09 06:53:09,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:09,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:09,572 INFO L229 MonitoredProcess]: Starting monitored process 142 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:09,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2025-03-09 06:53:09,574 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:09,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:09,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:09,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:09,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:09,585 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:09,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:09,588 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:09,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2025-03-09 06:53:09,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:09,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:09,596 INFO L229 MonitoredProcess]: Starting monitored process 143 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:09,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2025-03-09 06:53:09,597 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:53:09,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:09,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:09,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:09,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:09,609 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:09,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:09,613 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:09,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2025-03-09 06:53:09,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:09,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:09,621 INFO L229 MonitoredProcess]: Starting monitored process 144 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:09,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2025-03-09 06:53:09,622 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:09,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:09,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:09,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:09,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:09,636 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:09,636 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:09,643 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:09,652 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-09 06:53:09,652 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2025-03-09 06:53:09,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:09,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:09,654 INFO L229 MonitoredProcess]: Starting monitored process 145 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:09,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2025-03-09 06:53:09,656 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:09,667 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:53:09,667 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:09,667 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~mem15#1, v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_11) = 1*ULTIMATE.start_main_#t~mem16#1 - 1*ULTIMATE.start_main_#t~mem15#1 + 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_11 Supporting invariants [] [2025-03-09 06:53:09,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2025-03-09 06:53:09,690 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2025-03-09 06:53:09,693 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem15 [2025-03-09 06:53:09,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 06:53:09,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 06:53:09,694 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:09,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem16 [2025-03-09 06:53:09,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:09,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:09,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:09,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:09,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:09,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:53:09,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:09,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:53:09,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:53:09,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:09,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:09,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 06:53:09,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:09,755 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 38 treesize of output 15 [2025-03-09 06:53:09,770 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 27 treesize of output 19 [2025-03-09 06:53:09,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:09,812 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-03-09 06:53:09,813 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 430 states and 551 transitions. cyclomatic complexity: 141 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:09,888 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 430 states and 551 transitions. cyclomatic complexity: 141. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 698 states and 883 transitions. Complement of second has 13 states. [2025-03-09 06:53:09,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:09,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:09,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2025-03-09 06:53:09,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 18 letters. Loop has 12 letters. [2025-03-09 06:53:09,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:09,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 30 letters. Loop has 12 letters. [2025-03-09 06:53:09,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:09,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 18 letters. Loop has 24 letters. [2025-03-09 06:53:09,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:09,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 698 states and 883 transitions. [2025-03-09 06:53:09,891 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2025-03-09 06:53:09,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 698 states to 635 states and 809 transitions. [2025-03-09 06:53:09,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 194 [2025-03-09 06:53:09,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 196 [2025-03-09 06:53:09,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 635 states and 809 transitions. [2025-03-09 06:53:09,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:09,895 INFO L218 hiAutomatonCegarLoop]: Abstraction has 635 states and 809 transitions. [2025-03-09 06:53:09,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states and 809 transitions. [2025-03-09 06:53:09,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 556. [2025-03-09 06:53:09,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 556 states have (on average 1.2823741007194245) internal successors, (713), 555 states have internal predecessors, (713), 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,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 713 transitions. [2025-03-09 06:53:09,902 INFO L240 hiAutomatonCegarLoop]: Abstraction has 556 states and 713 transitions. [2025-03-09 06:53:09,902 INFO L432 stractBuchiCegarLoop]: Abstraction has 556 states and 713 transitions. [2025-03-09 06:53:09,902 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-09 06:53:09,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 556 states and 713 transitions. [2025-03-09 06:53:09,904 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2025-03-09 06:53:09,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:09,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:09,905 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:09,906 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:53:09,906 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem10#1 < main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#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;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:09,906 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:09,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:09,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1474183815, now seen corresponding path program 1 times [2025-03-09 06:53:09,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:09,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729907450] [2025-03-09 06:53:09,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:09,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:09,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:09,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:09,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:09,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:09,920 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:09,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:09,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:09,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:09,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:09,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:09,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:09,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1093939386, now seen corresponding path program 5 times [2025-03-09 06:53:09,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:09,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682327284] [2025-03-09 06:53:09,928 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:53:09,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:09,933 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:53:09,934 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:53:09,934 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:53:09,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:09,935 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:09,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:53:09,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:53:09,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:09,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:09,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:09,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:09,939 INFO L85 PathProgramCache]: Analyzing trace with hash -967051584, now seen corresponding path program 2 times [2025-03-09 06:53:09,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:09,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265508030] [2025-03-09 06:53:09,939 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:53:09,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:09,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 06:53:09,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:53:09,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:53:09,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:09,957 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:09,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:53:09,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:53:09,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:09,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:09,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:10,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:10,650 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:10,651 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:10,651 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:10,651 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:10,651 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:10,651 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:10,651 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:10,651 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:10,651 INFO L132 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca-2.i_Iteration13_Lasso [2025-03-09 06:53:10,651 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:10,651 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:10,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:10,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:10,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:10,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:10,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:10,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:10,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:10,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:10,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:10,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:10,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:10,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:10,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:10,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:10,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:10,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:10,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:10,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:10,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:11,078 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:11,078 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:11,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:11,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:11,080 INFO L229 MonitoredProcess]: Starting monitored process 146 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:11,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2025-03-09 06:53:11,082 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:11,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:11,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:11,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:11,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:11,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:11,092 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:11,092 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:11,092 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:11,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2025-03-09 06:53:11,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:11,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:11,101 INFO L229 MonitoredProcess]: Starting monitored process 147 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:11,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2025-03-09 06:53:11,102 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:11,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:11,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:11,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:11,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:11,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:11,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:11,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:11,113 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:11,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2025-03-09 06:53:11,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:11,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:11,122 INFO L229 MonitoredProcess]: Starting monitored process 148 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:11,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2025-03-09 06:53:11,124 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:11,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:11,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:11,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:11,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:11,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:11,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:11,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:11,135 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:11,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2025-03-09 06:53:11,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:11,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:11,143 INFO L229 MonitoredProcess]: Starting monitored process 149 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:11,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2025-03-09 06:53:11,144 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:11,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:11,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:11,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:11,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:11,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:11,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:11,157 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:11,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2025-03-09 06:53:11,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:11,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:11,164 INFO L229 MonitoredProcess]: Starting monitored process 150 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:11,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2025-03-09 06:53:11,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:53:11,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:11,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:11,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:11,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:11,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:11,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:11,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:11,177 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:11,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2025-03-09 06:53:11,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:11,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:11,184 INFO L229 MonitoredProcess]: Starting monitored process 151 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:11,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2025-03-09 06:53:11,186 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:11,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:11,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:11,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:11,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:11,196 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:11,196 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:11,198 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:11,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2025-03-09 06:53:11,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:11,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:11,207 INFO L229 MonitoredProcess]: Starting monitored process 152 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:11,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2025-03-09 06:53:11,209 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:11,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:11,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:11,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:11,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:11,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:11,219 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:11,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:11,221 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:11,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2025-03-09 06:53:11,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:11,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:11,228 INFO L229 MonitoredProcess]: Starting monitored process 153 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:11,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2025-03-09 06:53:11,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:53:11,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:11,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:11,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:11,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:11,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:11,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:11,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:11,241 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:11,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2025-03-09 06:53:11,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:11,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:11,248 INFO L229 MonitoredProcess]: Starting monitored process 154 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:11,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2025-03-09 06:53:11,250 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:11,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:11,260 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:11,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:11,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:11,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:11,260 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:11,260 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:11,261 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:11,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:11,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:11,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:11,268 INFO L229 MonitoredProcess]: Starting monitored process 155 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:11,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2025-03-09 06:53:11,270 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:11,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:11,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:11,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:11,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:11,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:11,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:11,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:11,281 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:11,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2025-03-09 06:53:11,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:11,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:11,288 INFO L229 MonitoredProcess]: Starting monitored process 156 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:11,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2025-03-09 06:53:11,289 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:11,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:11,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:11,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:11,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:11,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:11,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:11,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:11,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:11,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2025-03-09 06:53:11,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:11,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:11,308 INFO L229 MonitoredProcess]: Starting monitored process 157 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:11,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2025-03-09 06:53:11,309 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:11,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:11,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:11,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:11,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:11,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:11,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:11,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:11,320 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:11,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2025-03-09 06:53:11,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:11,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:11,328 INFO L229 MonitoredProcess]: Starting monitored process 158 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:11,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2025-03-09 06:53:11,329 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:11,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:11,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:11,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:11,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:11,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:11,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:11,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:11,340 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:11,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2025-03-09 06:53:11,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:11,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:11,348 INFO L229 MonitoredProcess]: Starting monitored process 159 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:11,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2025-03-09 06:53:11,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:53:11,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:11,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:11,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:11,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:11,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:11,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:11,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:11,363 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:11,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:11,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:11,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:11,370 INFO L229 MonitoredProcess]: Starting monitored process 160 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:11,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2025-03-09 06:53:11,372 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:11,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:11,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:11,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:11,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:11,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:11,383 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:11,387 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:11,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2025-03-09 06:53:11,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:11,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:11,395 INFO L229 MonitoredProcess]: Starting monitored process 161 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:11,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2025-03-09 06:53:11,396 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:11,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:11,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:11,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:11,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:11,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:11,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:11,412 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:11,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2025-03-09 06:53:11,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:11,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:11,419 INFO L229 MonitoredProcess]: Starting monitored process 162 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:11,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2025-03-09 06:53:11,421 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:11,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:11,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:11,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:11,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:11,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:11,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:11,435 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:11,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2025-03-09 06:53:11,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:11,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:11,443 INFO L229 MonitoredProcess]: Starting monitored process 163 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:11,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2025-03-09 06:53:11,445 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:11,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:11,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:11,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:11,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:11,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:11,459 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:11,468 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:11,483 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-03-09 06:53:11,483 INFO L444 ModelExtractionUtils]: 2 out of 22 variables were initially zero. Simplification set additionally 18 variables to zero. [2025-03-09 06:53:11,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:11,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:11,485 INFO L229 MonitoredProcess]: Starting monitored process 164 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:11,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2025-03-09 06:53:11,486 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:11,497 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:53:11,497 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:11,497 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)_3) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) 0)_3 Supporting invariants [] [2025-03-09 06:53:11,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2025-03-09 06:53:11,522 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2025-03-09 06:53:11,523 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 06:53:11,523 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 06:53:11,523 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:11,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:11,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:11,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:11,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:11,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:11,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:53:11,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:11,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:53:11,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:53:11,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:11,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:11,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:53:11,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:11,622 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:11,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2025-03-09 06:53:11,685 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:11,685 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:11,685 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 556 states and 713 transitions. cyclomatic complexity: 186 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:11,740 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 556 states and 713 transitions. cyclomatic complexity: 186. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 662 states and 839 transitions. Complement of second has 10 states. [2025-03-09 06:53:11,741 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:11,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:11,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2025-03-09 06:53:11,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 18 letters. Loop has 6 letters. [2025-03-09 06:53:11,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:11,741 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:11,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:11,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:11,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:11,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:11,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:11,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:53:11,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:11,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:53:11,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:53:11,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:11,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:11,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:53:11,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:11,831 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:11,888 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:11,888 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:11,889 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 556 states and 713 transitions. cyclomatic complexity: 186 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:11,937 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 556 states and 713 transitions. cyclomatic complexity: 186. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 669 states and 852 transitions. Complement of second has 10 states. [2025-03-09 06:53:11,937 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:11,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:11,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2025-03-09 06:53:11,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 18 letters. Loop has 6 letters. [2025-03-09 06:53:11,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:11,938 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:11,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:11,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:11,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:11,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:11,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:11,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:53:11,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:12,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:53:12,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:53:12,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:12,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:12,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:53:12,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:12,015 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:12,061 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:12,062 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:12,062 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 556 states and 713 transitions. cyclomatic complexity: 186 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:12,116 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 556 states and 713 transitions. cyclomatic complexity: 186. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 927 states and 1173 transitions. Complement of second has 11 states. [2025-03-09 06:53:12,117 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:12,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:12,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2025-03-09 06:53:12,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 18 letters. Loop has 6 letters. [2025-03-09 06:53:12,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:12,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 24 letters. Loop has 6 letters. [2025-03-09 06:53:12,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:12,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 18 letters. Loop has 12 letters. [2025-03-09 06:53:12,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:12,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 927 states and 1173 transitions. [2025-03-09 06:53:12,121 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 196 [2025-03-09 06:53:12,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 927 states to 688 states and 867 transitions. [2025-03-09 06:53:12,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 165 [2025-03-09 06:53:12,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 207 [2025-03-09 06:53:12,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 688 states and 867 transitions. [2025-03-09 06:53:12,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:12,123 INFO L218 hiAutomatonCegarLoop]: Abstraction has 688 states and 867 transitions. [2025-03-09 06:53:12,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states and 867 transitions. [2025-03-09 06:53:12,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 557. [2025-03-09 06:53:12,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 557 states have (on average 1.2764811490125674) internal successors, (711), 556 states have internal predecessors, (711), 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:12,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 711 transitions. [2025-03-09 06:53:12,131 INFO L240 hiAutomatonCegarLoop]: Abstraction has 557 states and 711 transitions. [2025-03-09 06:53:12,131 INFO L432 stractBuchiCegarLoop]: Abstraction has 557 states and 711 transitions. [2025-03-09 06:53:12,131 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-09 06:53:12,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 557 states and 711 transitions. [2025-03-09 06:53:12,133 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 147 [2025-03-09 06:53:12,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:12,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:12,133 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:12,133 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 1, 1, 1] [2025-03-09 06:53:12,133 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:12,134 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:12,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:12,134 INFO L85 PathProgramCache]: Analyzing trace with hash 102593923, now seen corresponding path program 1 times [2025-03-09 06:53:12,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:12,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940551933] [2025-03-09 06:53:12,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:12,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:12,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:12,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:12,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:12,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:12,152 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:12,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:12,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:12,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:12,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:12,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:12,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:12,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1302236285, now seen corresponding path program 2 times [2025-03-09 06:53:12,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:12,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041479782] [2025-03-09 06:53:12,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:53:12,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:12,170 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 06:53:12,174 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:12,174 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:53:12,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:12,174 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:12,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:12,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:12,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:12,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:12,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:12,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:12,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1703850875, now seen corresponding path program 2 times [2025-03-09 06:53:12,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:12,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452099452] [2025-03-09 06:53:12,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:53:12,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:12,189 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-09 06:53:12,196 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:53:12,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:53:12,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:12,197 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:12,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 06:53:12,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:53:12,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:12,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:12,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:13,332 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:13,332 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:13,332 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:13,332 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:13,332 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:13,332 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:13,332 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:13,332 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:13,332 INFO L132 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca-2.i_Iteration14_Lasso [2025-03-09 06:53:13,332 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:13,332 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:13,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:13,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:13,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:13,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:13,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:13,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:13,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:13,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:13,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:13,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:13,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:13,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:13,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:13,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:13,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:13,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:13,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:13,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:13,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:13,633 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:13,634 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:13,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:13,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:13,635 INFO L229 MonitoredProcess]: Starting monitored process 165 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:13,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2025-03-09 06:53:13,637 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:13,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:13,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:13,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:13,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:13,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:13,648 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:13,648 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:13,649 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:13,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2025-03-09 06:53:13,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:13,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:13,657 INFO L229 MonitoredProcess]: Starting monitored process 166 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:13,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2025-03-09 06:53:13,658 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:13,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:13,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:13,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:13,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:13,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:13,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:13,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:13,672 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:13,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2025-03-09 06:53:13,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:13,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:13,680 INFO L229 MonitoredProcess]: Starting monitored process 167 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:13,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2025-03-09 06:53:13,681 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:13,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:13,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:13,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:13,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:13,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:13,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:13,694 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:13,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2025-03-09 06:53:13,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:13,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:13,702 INFO L229 MonitoredProcess]: Starting monitored process 168 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:13,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2025-03-09 06:53:13,704 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:13,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:13,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:13,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:13,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:13,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:13,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:13,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:13,715 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:13,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2025-03-09 06:53:13,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:13,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:13,723 INFO L229 MonitoredProcess]: Starting monitored process 169 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:13,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2025-03-09 06:53:13,724 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:13,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:13,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:13,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:13,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:13,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:13,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:13,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:13,736 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:13,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0 [2025-03-09 06:53:13,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:13,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:13,743 INFO L229 MonitoredProcess]: Starting monitored process 170 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:13,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2025-03-09 06:53:13,745 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:13,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:13,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:13,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:13,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:13,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:13,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:13,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:13,756 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:13,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2025-03-09 06:53:13,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:13,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:13,764 INFO L229 MonitoredProcess]: Starting monitored process 171 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:13,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2025-03-09 06:53:13,765 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:13,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:13,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:13,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:13,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:13,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:13,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:13,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:13,777 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:13,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2025-03-09 06:53:13,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:13,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:13,785 INFO L229 MonitoredProcess]: Starting monitored process 172 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:13,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2025-03-09 06:53:13,786 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:13,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:13,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:13,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:13,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:13,801 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:13,801 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:13,808 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:13,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:13,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:13,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:13,817 INFO L229 MonitoredProcess]: Starting monitored process 173 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:13,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2025-03-09 06:53:13,818 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:13,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:13,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:13,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:13,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:13,830 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:13,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:13,836 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:13,850 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-09 06:53:13,850 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-09 06:53:13,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:13,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:13,853 INFO L229 MonitoredProcess]: Starting monitored process 174 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:13,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2025-03-09 06:53:13,855 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:13,866 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2025-03-09 06:53:13,866 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:13,866 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem10#1) = 1*ULTIMATE.start_main_#t~mem10#1 Supporting invariants [-1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_13 + 1*ULTIMATE.start_main_#t~mem10#1 >= 0, -1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_13 + 2*ULTIMATE.start_main_#t~mem10#1 >= 0] [2025-03-09 06:53:13,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Ended with exit code 0 [2025-03-09 06:53:13,896 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2025-03-09 06:53:13,898 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem10 [2025-03-09 06:53:13,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:13,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:13,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:13,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:13,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:13,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 06:53:13,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:13,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:13,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:13,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:13,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:13,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 06:53:13,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:13,975 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 25 treesize of output 17 [2025-03-09 06:53:13,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:14,011 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 31 treesize of output 23 [2025-03-09 06:53:14,014 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 38 treesize of output 15 [2025-03-09 06:53:14,036 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 23 treesize of output 15 [2025-03-09 06:53:14,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:14,085 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2025-03-09 06:53:14,085 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 557 states and 711 transitions. cyclomatic complexity: 183 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:14,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:14,239 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 557 states and 711 transitions. cyclomatic complexity: 183. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 1417 states and 1756 transitions. Complement of second has 19 states. [2025-03-09 06:53:14,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:14,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:14,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2025-03-09 06:53:14,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 40 transitions. Stem has 18 letters. Loop has 18 letters. [2025-03-09 06:53:14,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:14,240 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:14,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:14,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:14,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:14,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:14,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:14,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 06:53:14,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:14,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:14,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:14,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:14,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:14,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 06:53:14,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:14,303 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 25 treesize of output 17 [2025-03-09 06:53:14,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:14,332 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 31 treesize of output 23 [2025-03-09 06:53:14,333 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 38 treesize of output 15 [2025-03-09 06:53:14,348 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 23 treesize of output 15 [2025-03-09 06:53:14,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:14,388 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:14,389 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2025-03-09 06:53:14,389 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 557 states and 711 transitions. cyclomatic complexity: 183 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:14,507 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 557 states and 711 transitions. cyclomatic complexity: 183. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 1417 states and 1756 transitions. Complement of second has 19 states. [2025-03-09 06:53:14,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:14,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2025-03-09 06:53:14,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 40 transitions. Stem has 18 letters. Loop has 18 letters. [2025-03-09 06:53:14,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:14,508 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:14,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:14,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:14,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:14,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:14,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:14,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 06:53:14,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:14,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:14,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:14,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:14,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:14,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 06:53:14,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:14,577 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 25 treesize of output 17 [2025-03-09 06:53:14,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:14,609 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 31 treesize of output 23 [2025-03-09 06:53:14,611 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 38 treesize of output 15 [2025-03-09 06:53:14,624 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 23 treesize of output 15 [2025-03-09 06:53:14,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:14,669 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:14,669 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 7 loop predicates [2025-03-09 06:53:14,669 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 557 states and 711 transitions. cyclomatic complexity: 183 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:14,805 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 557 states and 711 transitions. cyclomatic complexity: 183. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 1638 states and 2059 transitions. Complement of second has 25 states. [2025-03-09 06:53:14,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:14,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:14,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2025-03-09 06:53:14,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 18 letters. Loop has 18 letters. [2025-03-09 06:53:14,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:14,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 36 letters. Loop has 18 letters. [2025-03-09 06:53:14,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:14,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 18 letters. Loop has 36 letters. [2025-03-09 06:53:14,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:14,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1638 states and 2059 transitions. [2025-03-09 06:53:14,810 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 353 [2025-03-09 06:53:14,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1638 states to 1185 states and 1490 transitions. [2025-03-09 06:53:14,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2025-03-09 06:53:14,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 240 [2025-03-09 06:53:14,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1185 states and 1490 transitions. [2025-03-09 06:53:14,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:14,814 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1185 states and 1490 transitions. [2025-03-09 06:53:14,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states and 1490 transitions. [2025-03-09 06:53:14,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 753. [2025-03-09 06:53:14,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 753 states have (on average 1.2802124833997344) internal successors, (964), 752 states have internal predecessors, (964), 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:14,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 964 transitions. [2025-03-09 06:53:14,823 INFO L240 hiAutomatonCegarLoop]: Abstraction has 753 states and 964 transitions. [2025-03-09 06:53:14,823 INFO L432 stractBuchiCegarLoop]: Abstraction has 753 states and 964 transitions. [2025-03-09 06:53:14,824 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-09 06:53:14,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 753 states and 964 transitions. [2025-03-09 06:53:14,825 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 261 [2025-03-09 06:53:14,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:14,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:14,826 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:14,826 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:14,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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem10#1 < main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#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;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:14,826 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem10#1 < main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#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;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:14,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:14,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1474183815, now seen corresponding path program 3 times [2025-03-09 06:53:14,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:14,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252938027] [2025-03-09 06:53:14,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:53:14,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:14,834 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-03-09 06:53:14,839 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:14,839 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 06:53:14,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:14,839 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:14,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:14,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:14,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:14,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:14,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:14,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:14,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1475698126, now seen corresponding path program 1 times [2025-03-09 06:53:14,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:14,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856924001] [2025-03-09 06:53:14,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:14,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:14,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:53:14,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:53:14,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:14,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:14,857 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:14,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:53:14,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:53:14,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:14,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:14,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:14,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:14,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1930823508, now seen corresponding path program 4 times [2025-03-09 06:53:14,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:14,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91623581] [2025-03-09 06:53:14,864 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:53:14,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:14,877 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-09 06:53:14,885 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:53:14,886 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:53:14,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:14,886 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:14,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:53:14,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:53:14,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:14,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:14,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:15,730 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:15,730 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:15,730 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:15,730 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:15,730 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:15,730 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:15,730 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:15,730 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:15,730 INFO L132 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca-2.i_Iteration15_Lasso [2025-03-09 06:53:15,730 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:15,730 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:15,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:15,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:15,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:15,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:15,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:15,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:15,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:15,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:15,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:15,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:15,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:15,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:15,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:15,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:15,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:15,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:15,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:15,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:15,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:16,071 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:16,071 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:16,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:16,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:16,073 INFO L229 MonitoredProcess]: Starting monitored process 175 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:16,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2025-03-09 06:53:16,074 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:16,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:16,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:16,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:16,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:16,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:16,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:16,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:16,085 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:16,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Ended with exit code 0 [2025-03-09 06:53:16,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:16,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:16,091 INFO L229 MonitoredProcess]: Starting monitored process 176 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:16,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2025-03-09 06:53:16,093 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:16,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:16,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:16,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:16,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:16,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:16,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:16,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:16,104 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:16,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2025-03-09 06:53:16,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:16,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:16,110 INFO L229 MonitoredProcess]: Starting monitored process 177 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:16,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2025-03-09 06:53:16,111 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:16,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:16,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:16,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:16,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:16,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:16,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:16,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:16,122 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:16,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Ended with exit code 0 [2025-03-09 06:53:16,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:16,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:16,129 INFO L229 MonitoredProcess]: Starting monitored process 178 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:16,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2025-03-09 06:53:16,130 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:16,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:16,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:16,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:16,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:16,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:16,140 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:16,140 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:16,141 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:16,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2025-03-09 06:53:16,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:16,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:16,148 INFO L229 MonitoredProcess]: Starting monitored process 179 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:16,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2025-03-09 06:53:16,150 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:16,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:16,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:16,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:16,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:16,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:16,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:16,160 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:16,161 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:16,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Ended with exit code 0 [2025-03-09 06:53:16,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:16,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:16,169 INFO L229 MonitoredProcess]: Starting monitored process 180 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:16,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2025-03-09 06:53:16,171 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:16,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:16,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:16,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:16,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:16,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:16,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:16,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:16,182 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:16,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Ended with exit code 0 [2025-03-09 06:53:16,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:16,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:16,188 INFO L229 MonitoredProcess]: Starting monitored process 181 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:16,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2025-03-09 06:53:16,189 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:16,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:16,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:16,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:16,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:16,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:16,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:16,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:16,200 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:16,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2025-03-09 06:53:16,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:16,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:16,207 INFO L229 MonitoredProcess]: Starting monitored process 182 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:16,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2025-03-09 06:53:16,208 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:16,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:16,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:16,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:16,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:16,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:16,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:16,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:16,221 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:16,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2025-03-09 06:53:16,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:16,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:16,230 INFO L229 MonitoredProcess]: Starting monitored process 183 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:16,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2025-03-09 06:53:16,231 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:16,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:16,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:16,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:16,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:16,243 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:16,243 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:16,247 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:16,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2025-03-09 06:53:16,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:16,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:16,254 INFO L229 MonitoredProcess]: Starting monitored process 184 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:16,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2025-03-09 06:53:16,255 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:16,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:16,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:16,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:16,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:16,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:16,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:16,272 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:16,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:16,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:16,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:16,279 INFO L229 MonitoredProcess]: Starting monitored process 185 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:16,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2025-03-09 06:53:16,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:16,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:16,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:16,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:16,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:16,291 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:16,291 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:16,293 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:16,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:16,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:16,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:16,301 INFO L229 MonitoredProcess]: Starting monitored process 186 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:16,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2025-03-09 06:53:16,302 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:16,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:16,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:16,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:16,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:16,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:16,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:16,326 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:16,350 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2025-03-09 06:53:16,350 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-03-09 06:53:16,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:16,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:16,352 INFO L229 MonitoredProcess]: Starting monitored process 187 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:16,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2025-03-09 06:53:16,354 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:16,364 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2025-03-09 06:53:16,364 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:16,364 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem16#1) = 1*ULTIMATE.start_main_#t~mem16#1 Supporting invariants [1*ULTIMATE.start_main_#t~mem15#1 - 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_14 >= 0, 1*ULTIMATE.start_main_#t~mem16#1 - 1 >= 0] [2025-03-09 06:53:16,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Ended with exit code 0 [2025-03-09 06:53:16,387 INFO L156 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2025-03-09 06:53:16,388 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem16 [2025-03-09 06:53:16,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:16,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Ended with exit code 0 [2025-03-09 06:53:16,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:16,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:16,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:16,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:16,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 06:53:16,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:16,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:53:16,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:53:16,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:16,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:16,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 06:53:16,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:16,462 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 38 treesize of output 15 [2025-03-09 06:53:16,474 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 17 treesize of output 9 [2025-03-09 06:53:16,486 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 27 treesize of output 15 [2025-03-09 06:53:16,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:16,532 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-03-09 06:53:16,532 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 753 states and 964 transitions. cyclomatic complexity: 247 Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:16,628 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 753 states and 964 transitions. cyclomatic complexity: 247. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1220 states and 1540 transitions. Complement of second has 15 states. [2025-03-09 06:53:16,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:16,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2025-03-09 06:53:16,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 18 letters. Loop has 12 letters. [2025-03-09 06:53:16,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:16,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 30 letters. Loop has 12 letters. [2025-03-09 06:53:16,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:16,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 18 letters. Loop has 24 letters. [2025-03-09 06:53:16,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:16,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1220 states and 1540 transitions. [2025-03-09 06:53:16,633 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 261 [2025-03-09 06:53:16,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1220 states to 1032 states and 1315 transitions. [2025-03-09 06:53:16,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 201 [2025-03-09 06:53:16,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 201 [2025-03-09 06:53:16,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1032 states and 1315 transitions. [2025-03-09 06:53:16,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:16,637 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1032 states and 1315 transitions. [2025-03-09 06:53:16,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states and 1315 transitions. [2025-03-09 06:53:16,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 824. [2025-03-09 06:53:16,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 824 states have (on average 1.2827669902912622) internal successors, (1057), 823 states have internal predecessors, (1057), 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:16,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1057 transitions. [2025-03-09 06:53:16,647 INFO L240 hiAutomatonCegarLoop]: Abstraction has 824 states and 1057 transitions. [2025-03-09 06:53:16,648 INFO L432 stractBuchiCegarLoop]: Abstraction has 824 states and 1057 transitions. [2025-03-09 06:53:16,648 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-09 06:53:16,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 824 states and 1057 transitions. [2025-03-09 06:53:16,649 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 261 [2025-03-09 06:53:16,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:16,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:16,650 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:16,650 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1] [2025-03-09 06:53:16,650 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:16,650 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:16,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:16,650 INFO L85 PathProgramCache]: Analyzing trace with hash 102593923, now seen corresponding path program 3 times [2025-03-09 06:53:16,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:16,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36528153] [2025-03-09 06:53:16,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:53:16,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:16,658 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-03-09 06:53:16,663 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:16,663 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 06:53:16,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:16,663 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:16,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:16,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:16,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:16,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:16,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:16,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:16,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1563207676, now seen corresponding path program 1 times [2025-03-09 06:53:16,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:16,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409427601] [2025-03-09 06:53:16,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:16,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:16,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:53:16,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:53:16,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:16,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:16,682 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:16,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:53:16,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:53:16,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:16,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:16,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:16,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:16,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1342322558, now seen corresponding path program 2 times [2025-03-09 06:53:16,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:16,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245544213] [2025-03-09 06:53:16,690 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:53:16,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:16,702 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-09 06:53:16,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 06:53:16,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:53:16,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:16,710 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:16,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 06:53:16,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 06:53:16,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:16,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:16,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:18,107 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:18,108 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:18,108 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:18,108 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:18,108 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:18,108 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:18,108 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:18,108 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:18,108 INFO L132 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca-2.i_Iteration16_Lasso [2025-03-09 06:53:18,108 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:18,108 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:18,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:18,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:18,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:18,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:18,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:18,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:18,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:18,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:18,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:18,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:18,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:18,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:18,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:18,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:18,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:18,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:18,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:18,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:18,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:18,458 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:18,458 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:18,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:18,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:18,460 INFO L229 MonitoredProcess]: Starting monitored process 188 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:18,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2025-03-09 06:53:18,463 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:18,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:18,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:18,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:18,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:18,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:18,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:18,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:18,473 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:18,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Ended with exit code 0 [2025-03-09 06:53:18,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:18,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:18,480 INFO L229 MonitoredProcess]: Starting monitored process 189 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:18,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2025-03-09 06:53:18,481 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:18,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:18,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:18,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:18,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:18,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:18,491 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:18,491 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:18,492 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:18,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Ended with exit code 0 [2025-03-09 06:53:18,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:18,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:18,499 INFO L229 MonitoredProcess]: Starting monitored process 190 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:18,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2025-03-09 06:53:18,500 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:18,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:18,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:18,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:18,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:18,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:18,510 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:18,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:18,511 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:18,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2025-03-09 06:53:18,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:18,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:18,517 INFO L229 MonitoredProcess]: Starting monitored process 191 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:18,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2025-03-09 06:53:18,519 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:18,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:18,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:18,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:18,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:18,528 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:18,528 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:18,531 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:18,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0 [2025-03-09 06:53:18,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:18,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:18,537 INFO L229 MonitoredProcess]: Starting monitored process 192 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:18,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2025-03-09 06:53:18,539 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:18,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:18,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:18,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:18,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:18,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:18,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:18,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:18,550 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:18,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:18,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:18,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:18,557 INFO L229 MonitoredProcess]: Starting monitored process 193 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:18,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2025-03-09 06:53:18,558 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:18,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:18,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:18,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:18,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:18,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:18,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:18,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:18,568 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:18,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Ended with exit code 0 [2025-03-09 06:53:18,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:18,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:18,575 INFO L229 MonitoredProcess]: Starting monitored process 194 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:18,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2025-03-09 06:53:18,577 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:18,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:18,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:18,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:18,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:18,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:18,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:18,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:18,587 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:18,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:18,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:18,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:18,594 INFO L229 MonitoredProcess]: Starting monitored process 195 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:18,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2025-03-09 06:53:18,595 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:18,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:18,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:18,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:18,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:18,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:18,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:18,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:18,605 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:18,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Ended with exit code 0 [2025-03-09 06:53:18,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:18,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:18,612 INFO L229 MonitoredProcess]: Starting monitored process 196 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:18,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2025-03-09 06:53:18,614 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:18,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:18,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:18,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:18,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:18,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:18,624 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:18,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:18,625 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:18,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Ended with exit code 0 [2025-03-09 06:53:18,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:18,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:18,632 INFO L229 MonitoredProcess]: Starting monitored process 197 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:18,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2025-03-09 06:53:18,633 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:18,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:18,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:18,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:18,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:18,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:18,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:18,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:18,644 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:18,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:18,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:18,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:18,651 INFO L229 MonitoredProcess]: Starting monitored process 198 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:18,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2025-03-09 06:53:18,652 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:18,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:18,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:18,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:18,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:18,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:18,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:18,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:18,663 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:18,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Ended with exit code 0 [2025-03-09 06:53:18,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:18,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:18,670 INFO L229 MonitoredProcess]: Starting monitored process 199 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:18,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2025-03-09 06:53:18,672 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:18,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:18,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:18,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:18,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:18,682 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:18,682 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:18,684 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:18,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:18,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:18,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:18,691 INFO L229 MonitoredProcess]: Starting monitored process 200 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:18,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2025-03-09 06:53:18,692 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:18,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:18,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:18,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:18,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:18,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:18,703 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:18,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:18,704 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:18,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Ended with exit code 0 [2025-03-09 06:53:18,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:18,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:18,711 INFO L229 MonitoredProcess]: Starting monitored process 201 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:18,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2025-03-09 06:53:18,712 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:18,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:18,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:18,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:18,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:18,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:18,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:18,733 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:18,754 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2025-03-09 06:53:18,754 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2025-03-09 06:53:18,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:18,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:18,756 INFO L229 MonitoredProcess]: Starting monitored process 202 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:18,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2025-03-09 06:53:18,758 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:18,768 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2025-03-09 06:53:18,768 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:18,768 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem10#1) = 1*ULTIMATE.start_main_#t~mem10#1 Supporting invariants [2*ULTIMATE.start_main_#t~mem10#1 - 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_15 >= 0, 1*ULTIMATE.start_main_#t~mem10#1 - 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) 0)_5 >= 0] [2025-03-09 06:53:18,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Ended with exit code 0 [2025-03-09 06:53:18,794 INFO L156 tatePredicateManager]: 12 out of 14 supporting invariants were superfluous and have been removed [2025-03-09 06:53:18,796 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem10 [2025-03-09 06:53:18,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:18,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:18,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:18,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:18,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:18,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:53:18,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:18,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:18,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:53:18,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:53:18,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:18,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:18,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-09 06:53:18,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:18,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-09 06:53:18,901 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 21 treesize of output 13 [2025-03-09 06:53:18,919 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 17 treesize of output 9 [2025-03-09 06:53:18,932 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 38 treesize of output 15 [2025-03-09 06:53:18,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-09 06:53:18,954 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 23 treesize of output 15 [2025-03-09 06:53:18,977 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 23 treesize of output 15 [2025-03-09 06:53:18,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:19,040 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:19,040 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2025-03-09 06:53:19,040 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 824 states and 1057 transitions. cyclomatic complexity: 274 Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:19,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:19,321 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 824 states and 1057 transitions. cyclomatic complexity: 274. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1977 states and 2473 transitions. Complement of second has 28 states. [2025-03-09 06:53:19,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:19,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:19,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 49 transitions. [2025-03-09 06:53:19,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 49 transitions. Stem has 18 letters. Loop has 24 letters. [2025-03-09 06:53:19,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:19,321 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:19,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:19,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:19,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:19,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:19,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:19,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:53:19,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:19,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:19,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:53:19,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:53:19,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:19,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:19,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-09 06:53:19,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:19,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-09 06:53:19,428 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 21 treesize of output 13 [2025-03-09 06:53:19,451 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 17 treesize of output 9 [2025-03-09 06:53:19,465 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 38 treesize of output 15 [2025-03-09 06:53:19,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-09 06:53:19,488 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 23 treesize of output 15 [2025-03-09 06:53:19,516 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 23 treesize of output 15 [2025-03-09 06:53:19,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:19,578 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:19,578 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2025-03-09 06:53:19,579 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 824 states and 1057 transitions. cyclomatic complexity: 274 Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:19,858 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 824 states and 1057 transitions. cyclomatic complexity: 274. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1977 states and 2473 transitions. Complement of second has 28 states. [2025-03-09 06:53:19,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:19,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:19,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 49 transitions. [2025-03-09 06:53:19,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 49 transitions. Stem has 18 letters. Loop has 24 letters. [2025-03-09 06:53:19,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:19,859 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:19,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:19,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:19,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:19,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:19,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:19,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:53:19,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:19,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:19,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:53:19,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:53:19,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:19,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:19,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-09 06:53:19,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:19,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-09 06:53:19,979 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 21 treesize of output 13 [2025-03-09 06:53:20,006 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 17 treesize of output 9 [2025-03-09 06:53:20,024 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 38 treesize of output 15 [2025-03-09 06:53:20,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-09 06:53:20,051 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 23 treesize of output 15 [2025-03-09 06:53:20,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:20,079 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 23 treesize of output 15 [2025-03-09 06:53:20,129 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:20,133 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 8 loop predicates [2025-03-09 06:53:20,133 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 824 states and 1057 transitions. cyclomatic complexity: 274 Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:20,510 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 824 states and 1057 transitions. cyclomatic complexity: 274. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2179 states and 2745 transitions. Complement of second has 39 states. [2025-03-09 06:53:20,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:20,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:20,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 53 transitions. [2025-03-09 06:53:20,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 53 transitions. Stem has 18 letters. Loop has 24 letters. [2025-03-09 06:53:20,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:20,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 53 transitions. Stem has 42 letters. Loop has 24 letters. [2025-03-09 06:53:20,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:20,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 53 transitions. Stem has 18 letters. Loop has 48 letters. [2025-03-09 06:53:20,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:20,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2179 states and 2745 transitions. [2025-03-09 06:53:20,517 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 519 [2025-03-09 06:53:20,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2179 states to 1537 states and 1944 transitions. [2025-03-09 06:53:20,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 238 [2025-03-09 06:53:20,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 263 [2025-03-09 06:53:20,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1537 states and 1944 transitions. [2025-03-09 06:53:20,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:20,522 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1537 states and 1944 transitions. [2025-03-09 06:53:20,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states and 1944 transitions. [2025-03-09 06:53:20,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1081. [2025-03-09 06:53:20,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1081 states have (on average 1.297872340425532) internal successors, (1403), 1080 states have internal predecessors, (1403), 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:20,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1403 transitions. [2025-03-09 06:53:20,557 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1081 states and 1403 transitions. [2025-03-09 06:53:20,557 INFO L432 stractBuchiCegarLoop]: Abstraction has 1081 states and 1403 transitions. [2025-03-09 06:53:20,557 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-03-09 06:53:20,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1081 states and 1403 transitions. [2025-03-09 06:53:20,561 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 359 [2025-03-09 06:53:20,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:20,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:20,563 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:20,563 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 5, 3, 3, 3, 2, 2, 2] [2025-03-09 06:53:20,563 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:20,563 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:20,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:20,564 INFO L85 PathProgramCache]: Analyzing trace with hash 102593923, now seen corresponding path program 4 times [2025-03-09 06:53:20,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:20,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831207280] [2025-03-09 06:53:20,564 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:53:20,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:20,571 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-09 06:53:20,576 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:20,576 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:53:20,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:20,576 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:20,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:20,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:20,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:20,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:20,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:20,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:20,587 INFO L85 PathProgramCache]: Analyzing trace with hash -476648624, now seen corresponding path program 3 times [2025-03-09 06:53:20,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:20,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801481004] [2025-03-09 06:53:20,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:53:20,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:20,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 3 equivalence classes. [2025-03-09 06:53:20,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:53:20,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 06:53:20,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:20,608 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:20,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:53:20,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:53:20,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:20,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:20,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:20,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:20,618 INFO L85 PathProgramCache]: Analyzing trace with hash 447697234, now seen corresponding path program 5 times [2025-03-09 06:53:20,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:20,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127464463] [2025-03-09 06:53:20,618 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:53:20,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:20,630 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 8 equivalence classes. [2025-03-09 06:53:20,644 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 06:53:20,644 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-09 06:53:20,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:20,645 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:20,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 06:53:20,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 06:53:20,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:20,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:20,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:22,982 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:22,982 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:22,982 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:22,982 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:22,982 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:22,982 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:22,982 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:22,982 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:22,982 INFO L132 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca-2.i_Iteration17_Lasso [2025-03-09 06:53:22,982 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:22,982 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:22,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:22,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:22,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:22,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:22,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:22,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:22,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:22,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:23,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:23,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:23,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:23,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:23,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:23,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:23,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:23,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:23,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:23,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:23,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:23,266 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:23,267 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:23,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:23,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:23,269 INFO L229 MonitoredProcess]: Starting monitored process 203 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:23,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Waiting until timeout for monitored process [2025-03-09 06:53:23,271 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:23,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:23,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:23,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:23,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:23,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:23,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:23,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:23,283 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:23,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Ended with exit code 0 [2025-03-09 06:53:23,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:23,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:23,292 INFO L229 MonitoredProcess]: Starting monitored process 204 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:23,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Waiting until timeout for monitored process [2025-03-09 06:53:23,294 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:23,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:23,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:23,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:23,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:23,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:23,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:23,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:23,306 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:23,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:23,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:23,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:23,315 INFO L229 MonitoredProcess]: Starting monitored process 205 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:23,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Waiting until timeout for monitored process [2025-03-09 06:53:23,317 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:23,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:23,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:23,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:23,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:23,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:23,330 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:23,330 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:23,331 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:23,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Ended with exit code 0 [2025-03-09 06:53:23,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:23,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:23,338 INFO L229 MonitoredProcess]: Starting monitored process 206 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:23,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Waiting until timeout for monitored process [2025-03-09 06:53:23,340 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:23,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:23,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:23,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:23,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:23,351 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:23,351 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:23,353 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:23,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Ended with exit code 0 [2025-03-09 06:53:23,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:23,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:23,360 INFO L229 MonitoredProcess]: Starting monitored process 207 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:23,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Waiting until timeout for monitored process [2025-03-09 06:53:23,362 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:23,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:23,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:23,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:23,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:23,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:23,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:23,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:23,372 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:23,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Ended with exit code 0 [2025-03-09 06:53:23,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:23,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:23,380 INFO L229 MonitoredProcess]: Starting monitored process 208 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:23,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Waiting until timeout for monitored process [2025-03-09 06:53:23,381 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:23,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:23,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:23,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:23,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:23,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:23,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:23,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:23,392 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:23,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Ended with exit code 0 [2025-03-09 06:53:23,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:23,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:23,399 INFO L229 MonitoredProcess]: Starting monitored process 209 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:23,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Waiting until timeout for monitored process [2025-03-09 06:53:23,401 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:23,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:23,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:23,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:23,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:23,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:23,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:23,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:23,412 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:23,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Ended with exit code 0 [2025-03-09 06:53:23,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:23,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:23,419 INFO L229 MonitoredProcess]: Starting monitored process 210 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:23,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Waiting until timeout for monitored process [2025-03-09 06:53:23,420 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:23,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:23,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:23,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:23,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:23,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:23,431 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:23,434 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:23,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Ended with exit code 0 [2025-03-09 06:53:23,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:23,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:23,441 INFO L229 MonitoredProcess]: Starting monitored process 211 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:23,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Waiting until timeout for monitored process [2025-03-09 06:53:23,442 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:23,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:23,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:23,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:23,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:23,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:23,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:23,458 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:23,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Ended with exit code 0 [2025-03-09 06:53:23,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:23,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:23,466 INFO L229 MonitoredProcess]: Starting monitored process 212 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:23,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Waiting until timeout for monitored process [2025-03-09 06:53:23,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:53:23,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:23,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:23,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:23,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:23,479 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:23,479 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:23,485 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:23,495 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-03-09 06:53:23,496 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 13 variables to zero. [2025-03-09 06:53:23,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:23,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:23,498 INFO L229 MonitoredProcess]: Starting monitored process 213 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:23,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Waiting until timeout for monitored process [2025-03-09 06:53:23,500 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:23,510 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:53:23,511 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:23,511 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)_16) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_16 Supporting invariants [] [2025-03-09 06:53:23,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Ended with exit code 0 [2025-03-09 06:53:23,531 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-03-09 06:53:23,532 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 06:53:23,532 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 06:53:23,532 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:23,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:23,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:23,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:23,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:23,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:23,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:53:23,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:23,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:53:23,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:53:23,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:23,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:23,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 06:53:23,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:23,595 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 25 treesize of output 17 [2025-03-09 06:53:23,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:23,618 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 31 treesize of output 23 [2025-03-09 06:53:23,619 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 38 treesize of output 15 [2025-03-09 06:53:23,631 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 23 treesize of output 15 [2025-03-09 06:53:23,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:23,646 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 27 treesize of output 19 [2025-03-09 06:53:23,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:23,668 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 23 treesize of output 15 [2025-03-09 06:53:23,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 22 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:23,708 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2025-03-09 06:53:23,709 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1081 states and 1403 transitions. cyclomatic complexity: 372 Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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:23,989 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1081 states and 1403 transitions. cyclomatic complexity: 372. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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 3366 states and 4218 transitions. Complement of second has 33 states. [2025-03-09 06:53:23,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 15 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:23,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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:23,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2025-03-09 06:53:23,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 70 transitions. Stem has 18 letters. Loop has 30 letters. [2025-03-09 06:53:23,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:23,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 70 transitions. Stem has 48 letters. Loop has 30 letters. [2025-03-09 06:53:23,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:23,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 70 transitions. Stem has 18 letters. Loop has 60 letters. [2025-03-09 06:53:23,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:23,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3366 states and 4218 transitions. [2025-03-09 06:53:23,996 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 378 [2025-03-09 06:53:24,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3366 states to 2669 states and 3363 transitions. [2025-03-09 06:53:24,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 388 [2025-03-09 06:53:24,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 408 [2025-03-09 06:53:24,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2669 states and 3363 transitions. [2025-03-09 06:53:24,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:24,004 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2669 states and 3363 transitions. [2025-03-09 06:53:24,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2669 states and 3363 transitions. [2025-03-09 06:53:24,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2669 to 1818. [2025-03-09 06:53:24,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1818 states, 1818 states have (on average 1.297029702970297) internal successors, (2358), 1817 states have internal predecessors, (2358), 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:24,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 2358 transitions. [2025-03-09 06:53:24,036 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1818 states and 2358 transitions. [2025-03-09 06:53:24,036 INFO L432 stractBuchiCegarLoop]: Abstraction has 1818 states and 2358 transitions. [2025-03-09 06:53:24,036 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-03-09 06:53:24,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1818 states and 2358 transitions. [2025-03-09 06:53:24,038 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 378 [2025-03-09 06:53:24,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:24,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:24,039 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:24,039 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:24,040 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem10#1 < main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#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;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:24,040 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_#t~mem10#1 < main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#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;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:24,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:24,040 INFO L85 PathProgramCache]: Analyzing trace with hash 231676642, now seen corresponding path program 1 times [2025-03-09 06:53:24,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:24,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75205781] [2025-03-09 06:53:24,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:24,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:24,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:24,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:24,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:24,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:24,050 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:24,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:24,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:24,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:24,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:24,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:24,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:24,058 INFO L85 PathProgramCache]: Analyzing trace with hash -940421075, now seen corresponding path program 1 times [2025-03-09 06:53:24,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:24,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349175429] [2025-03-09 06:53:24,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:24,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:24,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:53:24,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:53:24,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:24,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:24,067 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:24,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:53:24,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:53:24,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:24,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:24,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:24,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:24,072 INFO L85 PathProgramCache]: Analyzing trace with hash -2028789362, now seen corresponding path program 2 times [2025-03-09 06:53:24,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:24,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573981948] [2025-03-09 06:53:24,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:53:24,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:24,083 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-09 06:53:24,121 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:53:24,121 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:53:24,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:24,121 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:24,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:53:24,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:53:24,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:24,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:24,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:24,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Ended with exit code 0 [2025-03-09 06:53:25,017 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:25,017 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:25,017 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:25,017 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:25,017 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:25,017 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:25,017 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:25,017 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:25,017 INFO L132 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca-2.i_Iteration18_Lasso [2025-03-09 06:53:25,017 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:25,017 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:25,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:25,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:25,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:25,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:25,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:25,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:25,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:25,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:25,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:25,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:25,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:25,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:25,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:25,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:25,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:25,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:25,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:25,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:25,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:25,332 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:25,332 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:25,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:25,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:25,338 INFO L229 MonitoredProcess]: Starting monitored process 214 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:25,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Waiting until timeout for monitored process [2025-03-09 06:53:25,340 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:25,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:25,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:25,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:25,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:25,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:25,350 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:25,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:25,351 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:25,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:25,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:25,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:25,358 INFO L229 MonitoredProcess]: Starting monitored process 215 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:25,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Waiting until timeout for monitored process [2025-03-09 06:53:25,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:25,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:25,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:25,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:25,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:25,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:25,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:25,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:25,370 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:25,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Ended with exit code 0 [2025-03-09 06:53:25,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:25,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:25,377 INFO L229 MonitoredProcess]: Starting monitored process 216 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:25,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Waiting until timeout for monitored process [2025-03-09 06:53:25,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:53:25,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:25,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:25,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:25,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:25,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:25,390 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:25,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:25,391 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:25,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:25,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:25,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:25,399 INFO L229 MonitoredProcess]: Starting monitored process 217 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:25,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Waiting until timeout for monitored process [2025-03-09 06:53:25,401 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:25,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:25,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:25,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:25,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:25,413 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:25,413 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:25,415 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:25,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:25,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:25,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:25,422 INFO L229 MonitoredProcess]: Starting monitored process 218 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:25,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Waiting until timeout for monitored process [2025-03-09 06:53:25,424 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:25,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:25,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:25,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:25,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:25,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:25,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:25,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:25,435 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:25,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Ended with exit code 0 [2025-03-09 06:53:25,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:25,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:25,443 INFO L229 MonitoredProcess]: Starting monitored process 219 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:25,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Waiting until timeout for monitored process [2025-03-09 06:53:25,445 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:25,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:25,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:25,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:25,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:25,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:25,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:25,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:25,457 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:25,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Ended with exit code 0 [2025-03-09 06:53:25,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:25,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:25,466 INFO L229 MonitoredProcess]: Starting monitored process 220 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:25,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Waiting until timeout for monitored process [2025-03-09 06:53:25,468 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:25,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:25,477 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:25,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:25,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:25,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:25,477 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:25,477 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:25,479 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:25,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Ended with exit code 0 [2025-03-09 06:53:25,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:25,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:25,485 INFO L229 MonitoredProcess]: Starting monitored process 221 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:25,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Waiting until timeout for monitored process [2025-03-09 06:53:25,487 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:25,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:25,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:25,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:25,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:25,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:25,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:25,497 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:25,498 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:25,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Ended with exit code 0 [2025-03-09 06:53:25,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:25,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:25,505 INFO L229 MonitoredProcess]: Starting monitored process 222 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:25,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Waiting until timeout for monitored process [2025-03-09 06:53:25,506 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:25,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:25,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:25,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:25,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:25,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:25,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:25,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:25,517 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:25,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Ended with exit code 0 [2025-03-09 06:53:25,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:25,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:25,524 INFO L229 MonitoredProcess]: Starting monitored process 223 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:25,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Waiting until timeout for monitored process [2025-03-09 06:53:25,525 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:25,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:25,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:25,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:25,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:25,536 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:25,536 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:25,539 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:25,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Ended with exit code 0 [2025-03-09 06:53:25,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:25,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:25,546 INFO L229 MonitoredProcess]: Starting monitored process 224 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:25,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Waiting until timeout for monitored process [2025-03-09 06:53:25,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:53:25,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:25,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:25,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:25,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:25,558 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:25,558 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:25,562 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:25,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Ended with exit code 0 [2025-03-09 06:53:25,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:25,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:25,569 INFO L229 MonitoredProcess]: Starting monitored process 225 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:25,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Waiting until timeout for monitored process [2025-03-09 06:53:25,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:25,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:25,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:25,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:25,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:25,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:25,583 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:25,590 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:25,600 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-09 06:53:25,600 INFO L444 ModelExtractionUtils]: 8 out of 19 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-09 06:53:25,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:25,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:25,602 INFO L229 MonitoredProcess]: Starting monitored process 226 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:25,617 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:25,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Waiting until timeout for monitored process [2025-03-09 06:53:25,629 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:53:25,629 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:25,630 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~mem10#1, v_rep(select (select #memory_int#0 ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_17) = -1*ULTIMATE.start_main_#t~mem11#1 + 1*ULTIMATE.start_main_#t~mem10#1 + 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_17 Supporting invariants [] [2025-03-09 06:53:25,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:25,650 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2025-03-09 06:53:25,651 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:53:25,651 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:53:25,651 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:25,651 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem11 [2025-03-09 06:53:25,651 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem10 [2025-03-09 06:53:25,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:25,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:25,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:25,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:25,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:25,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:53:25,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:25,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:53:25,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:53:25,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:25,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:25,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 06:53:25,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:25,708 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 25 treesize of output 13 [2025-03-09 06:53:25,724 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 23 treesize of output 15 [2025-03-09 06:53:25,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:25,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:25,772 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-03-09 06:53:25,772 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1818 states and 2358 transitions. cyclomatic complexity: 622 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:25,845 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1818 states and 2358 transitions. cyclomatic complexity: 622. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2029 states and 2617 transitions. Complement of second has 13 states. [2025-03-09 06:53:25,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:25,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:25,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2025-03-09 06:53:25,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 18 letters. Loop has 12 letters. [2025-03-09 06:53:25,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:25,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 30 letters. Loop has 12 letters. [2025-03-09 06:53:25,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:25,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 18 letters. Loop has 24 letters. [2025-03-09 06:53:25,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:25,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2029 states and 2617 transitions. [2025-03-09 06:53:25,853 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 378 [2025-03-09 06:53:25,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2029 states to 1987 states and 2568 transitions. [2025-03-09 06:53:25,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 275 [2025-03-09 06:53:25,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 279 [2025-03-09 06:53:25,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1987 states and 2568 transitions. [2025-03-09 06:53:25,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:25,860 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1987 states and 2568 transitions. [2025-03-09 06:53:25,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states and 2568 transitions. [2025-03-09 06:53:25,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1896. [2025-03-09 06:53:25,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1896 states, 1896 states have (on average 1.2958860759493671) internal successors, (2457), 1895 states have internal predecessors, (2457), 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:25,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2457 transitions. [2025-03-09 06:53:25,886 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1896 states and 2457 transitions. [2025-03-09 06:53:25,886 INFO L432 stractBuchiCegarLoop]: Abstraction has 1896 states and 2457 transitions. [2025-03-09 06:53:25,886 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-03-09 06:53:25,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1896 states and 2457 transitions. [2025-03-09 06:53:25,889 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 378 [2025-03-09 06:53:25,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:25,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:25,889 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:25,889 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:25,890 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:25,890 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:25,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:25,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1574637383, now seen corresponding path program 6 times [2025-03-09 06:53:25,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:25,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948711819] [2025-03-09 06:53:25,890 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:53:25,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:25,900 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 3 equivalence classes. [2025-03-09 06:53:25,910 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:25,910 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-09 06:53:25,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:25,910 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:25,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:25,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:25,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:25,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:25,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:25,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:25,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1447068975, now seen corresponding path program 2 times [2025-03-09 06:53:25,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:25,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339355083] [2025-03-09 06:53:25,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:53:25,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:25,925 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-09 06:53:25,928 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:25,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:53:25,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:25,928 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:25,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:53:25,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:53:25,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:25,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:25,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:25,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:25,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1462707339, now seen corresponding path program 3 times [2025-03-09 06:53:25,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:25,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498669254] [2025-03-09 06:53:25,937 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:53:25,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:25,947 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 5 equivalence classes. [2025-03-09 06:53:25,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:53:25,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-09 06:53:25,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:25,957 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:25,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:53:25,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:53:25,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:25,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:25,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:26,932 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:26,932 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:26,932 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:26,932 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:26,932 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:26,932 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:26,932 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:26,932 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:26,932 INFO L132 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca-2.i_Iteration19_Lasso [2025-03-09 06:53:26,932 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:26,932 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:26,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:26,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:26,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:26,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:26,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:26,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:26,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:27,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:27,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:27,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:27,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:27,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:27,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:27,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:27,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:27,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:27,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:27,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:27,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:27,194 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:27,194 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:27,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:27,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:27,199 INFO L229 MonitoredProcess]: Starting monitored process 227 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:27,202 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:27,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Waiting until timeout for monitored process [2025-03-09 06:53:27,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:27,212 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:27,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:27,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:27,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:27,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:27,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:27,214 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:27,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:27,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:27,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:27,220 INFO L229 MonitoredProcess]: Starting monitored process 228 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:27,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Waiting until timeout for monitored process [2025-03-09 06:53:27,222 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:27,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:27,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:27,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:27,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:27,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:27,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:27,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:27,233 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:27,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Ended with exit code 0 [2025-03-09 06:53:27,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:27,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:27,240 INFO L229 MonitoredProcess]: Starting monitored process 229 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:27,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Waiting until timeout for monitored process [2025-03-09 06:53:27,242 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:27,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:27,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:27,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:27,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:27,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:27,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:27,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:27,252 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:27,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Ended with exit code 0 [2025-03-09 06:53:27,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:27,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:27,259 INFO L229 MonitoredProcess]: Starting monitored process 230 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:27,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (230)] Waiting until timeout for monitored process [2025-03-09 06:53:27,261 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:27,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:27,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:27,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:27,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:27,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:27,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:27,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:27,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (230)] Ended with exit code 0 [2025-03-09 06:53:27,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:27,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:27,284 INFO L229 MonitoredProcess]: Starting monitored process 231 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:27,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (231)] Waiting until timeout for monitored process [2025-03-09 06:53:27,285 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:27,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:27,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:27,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:27,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:27,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:27,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:27,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:27,297 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:27,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (231)] Ended with exit code 0 [2025-03-09 06:53:27,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:27,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:27,303 INFO L229 MonitoredProcess]: Starting monitored process 232 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:27,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Waiting until timeout for monitored process [2025-03-09 06:53:27,305 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:27,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:27,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:27,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:27,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:27,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:27,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:27,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:27,316 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:27,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Ended with exit code 0 [2025-03-09 06:53:27,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:27,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:27,322 INFO L229 MonitoredProcess]: Starting monitored process 233 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:27,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (233)] Waiting until timeout for monitored process [2025-03-09 06:53:27,324 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:27,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:27,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:27,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:27,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:27,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:27,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:27,338 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:27,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (233)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:27,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:27,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:27,348 INFO L229 MonitoredProcess]: Starting monitored process 234 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:27,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (234)] Waiting until timeout for monitored process [2025-03-09 06:53:27,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:53:27,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:27,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:27,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:27,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:27,359 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:27,360 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:27,362 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:27,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (234)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:27,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:27,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:27,368 INFO L229 MonitoredProcess]: Starting monitored process 235 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:27,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (235)] Waiting until timeout for monitored process [2025-03-09 06:53:27,370 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:27,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:27,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:27,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:27,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:27,381 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:27,381 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:27,385 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:27,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (235)] Ended with exit code 0 [2025-03-09 06:53:27,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:27,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:27,394 INFO L229 MonitoredProcess]: Starting monitored process 236 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:27,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (236)] Waiting until timeout for monitored process [2025-03-09 06:53:27,396 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:27,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:27,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:27,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:27,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:27,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:27,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:27,413 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:27,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (236)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:27,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:27,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:27,420 INFO L229 MonitoredProcess]: Starting monitored process 237 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:27,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (237)] Waiting until timeout for monitored process [2025-03-09 06:53:27,437 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:27,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Ended with exit code 0 [2025-03-09 06:53:27,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:27,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:27,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:27,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:27,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:27,449 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:27,452 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:27,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (237)] Ended with exit code 0 [2025-03-09 06:53:27,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:27,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:27,459 INFO L229 MonitoredProcess]: Starting monitored process 238 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:27,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (238)] Waiting until timeout for monitored process [2025-03-09 06:53:27,460 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:27,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:27,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:27,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:27,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:27,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:27,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:27,478 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:27,487 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-03-09 06:53:27,487 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-09 06:53:27,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:27,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:27,489 INFO L229 MonitoredProcess]: Starting monitored process 239 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:27,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (239)] Waiting until timeout for monitored process [2025-03-09 06:53:27,491 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:27,502 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2025-03-09 06:53:27,502 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:27,502 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)_18) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_18 + 1 Supporting invariants [-1*ULTIMATE.start_main_#t~mem16#1 + 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_18 - 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_18 + 1*ULTIMATE.start_main_#t~mem15#1 >= 0, 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_18 >= 0] [2025-03-09 06:53:27,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (238)] Ended with exit code 0 [2025-03-09 06:53:27,526 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2025-03-09 06:53:27,527 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:53:27,528 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:53:27,528 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:27,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:27,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:27,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:27,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:27,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:27,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:53:27,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:27,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:53:27,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:53:27,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:27,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:27,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 06:53:27,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:27,592 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 42 treesize of output 19 [2025-03-09 06:53:27,593 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 23 treesize of output 15 [2025-03-09 06:53:27,606 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 27 treesize of output 19 [2025-03-09 06:53:27,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:27,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:27,643 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-03-09 06:53:27,643 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1896 states and 2457 transitions. cyclomatic complexity: 648 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:27,721 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1896 states and 2457 transitions. cyclomatic complexity: 648. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2673 states and 3363 transitions. Complement of second has 14 states. [2025-03-09 06:53:27,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 2 accepting loop states [2025-03-09 06:53:27,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:27,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2025-03-09 06:53:27,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 18 letters. Loop has 12 letters. [2025-03-09 06:53:27,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:27,722 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:27,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:27,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:27,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:27,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:27,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:27,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:53:27,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:27,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:53:27,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:53:27,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:27,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:27,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 06:53:27,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:27,784 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 42 treesize of output 19 [2025-03-09 06:53:27,785 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 23 treesize of output 15 [2025-03-09 06:53:27,797 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 27 treesize of output 19 [2025-03-09 06:53:27,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:27,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:27,848 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2025-03-09 06:53:27,848 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1896 states and 2457 transitions. cyclomatic complexity: 648 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:27,927 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1896 states and 2457 transitions. cyclomatic complexity: 648. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2853 states and 3590 transitions. Complement of second has 13 states. [2025-03-09 06:53:27,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:27,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:27,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2025-03-09 06:53:27,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 18 letters. Loop has 12 letters. [2025-03-09 06:53:27,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:27,927 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:27,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:27,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:27,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:27,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:27,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:27,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:53:27,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:27,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:53:27,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:53:27,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:27,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:27,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 06:53:27,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:27,993 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 42 treesize of output 19 [2025-03-09 06:53:27,995 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 23 treesize of output 15 [2025-03-09 06:53:28,009 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 27 treesize of output 19 [2025-03-09 06:53:28,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:28,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:28,048 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 5 loop predicates [2025-03-09 06:53:28,048 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1896 states and 2457 transitions. cyclomatic complexity: 648 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:28,118 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1896 states and 2457 transitions. cyclomatic complexity: 648. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 3813 states and 4821 transitions. Complement of second has 15 states. [2025-03-09 06:53:28,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 2 accepting loop states [2025-03-09 06:53:28,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:28,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2025-03-09 06:53:28,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 18 letters. Loop has 12 letters. [2025-03-09 06:53:28,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:28,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 30 letters. Loop has 12 letters. [2025-03-09 06:53:28,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:28,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 18 letters. Loop has 24 letters. [2025-03-09 06:53:28,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:28,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3813 states and 4821 transitions. [2025-03-09 06:53:28,127 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 717 [2025-03-09 06:53:28,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3813 states to 3105 states and 3926 transitions. [2025-03-09 06:53:28,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 339 [2025-03-09 06:53:28,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 359 [2025-03-09 06:53:28,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3105 states and 3926 transitions. [2025-03-09 06:53:28,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:28,136 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3105 states and 3926 transitions. [2025-03-09 06:53:28,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3105 states and 3926 transitions. [2025-03-09 06:53:28,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3105 to 2194. [2025-03-09 06:53:28,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2194 states, 2194 states have (on average 1.316317228805834) internal successors, (2888), 2193 states have internal predecessors, (2888), 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:28,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2194 states to 2194 states and 2888 transitions. [2025-03-09 06:53:28,159 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2194 states and 2888 transitions. [2025-03-09 06:53:28,159 INFO L432 stractBuchiCegarLoop]: Abstraction has 2194 states and 2888 transitions. [2025-03-09 06:53:28,159 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-03-09 06:53:28,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2194 states and 2888 transitions. [2025-03-09 06:53:28,162 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 481 [2025-03-09 06:53:28,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:28,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:28,164 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:28,164 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 1, 1, 1] [2025-03-09 06:53:28,165 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:28,165 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:28,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:28,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1574637383, now seen corresponding path program 7 times [2025-03-09 06:53:28,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:28,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422289854] [2025-03-09 06:53:28,165 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:53:28,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:28,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:28,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:28,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:28,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:28,175 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:28,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:28,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:28,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:28,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:28,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:28,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:28,184 INFO L85 PathProgramCache]: Analyzing trace with hash 720825828, now seen corresponding path program 3 times [2025-03-09 06:53:28,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:28,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527947212] [2025-03-09 06:53:28,184 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:53:28,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:28,190 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-03-09 06:53:28,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:28,194 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 06:53:28,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:28,194 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:28,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:28,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:28,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:28,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:28,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:28,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:28,200 INFO L85 PathProgramCache]: Analyzing trace with hash 543356842, now seen corresponding path program 4 times [2025-03-09 06:53:28,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:28,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997322770] [2025-03-09 06:53:28,201 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:53:28,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:28,211 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-03-09 06:53:28,220 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:53:28,220 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:53:28,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:28,220 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:28,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 06:53:28,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:53:28,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:28,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:28,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:28,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (239)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:29,242 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:29,242 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:29,242 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:29,242 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:29,242 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:29,242 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:29,242 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:29,242 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:29,242 INFO L132 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca-2.i_Iteration20_Lasso [2025-03-09 06:53:29,243 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:29,243 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:29,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:29,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:29,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:29,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:29,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:29,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:29,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:29,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:29,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:29,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:29,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:29,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:29,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:29,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:29,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:29,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:29,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:29,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:29,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:29,569 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:29,569 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:29,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:29,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:29,571 INFO L229 MonitoredProcess]: Starting monitored process 240 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:29,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (240)] Waiting until timeout for monitored process [2025-03-09 06:53:29,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:53:29,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:29,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:29,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:29,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:29,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:29,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:29,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:29,583 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:29,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (240)] Ended with exit code 0 [2025-03-09 06:53:29,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:29,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:29,590 INFO L229 MonitoredProcess]: Starting monitored process 241 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:29,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (241)] Waiting until timeout for monitored process [2025-03-09 06:53:29,592 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:29,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:29,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:29,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:29,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:29,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:29,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:29,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:29,603 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:29,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (241)] Ended with exit code 0 [2025-03-09 06:53:29,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:29,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:29,609 INFO L229 MonitoredProcess]: Starting monitored process 242 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:29,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (242)] Waiting until timeout for monitored process [2025-03-09 06:53:29,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:29,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:29,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:29,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:29,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:29,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:29,621 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:29,623 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:29,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (242)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:29,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:29,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:29,630 INFO L229 MonitoredProcess]: Starting monitored process 243 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:29,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (243)] Waiting until timeout for monitored process [2025-03-09 06:53:29,631 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:29,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:29,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:29,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:29,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:29,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:29,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:29,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:29,641 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:29,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (243)] Ended with exit code 0 [2025-03-09 06:53:29,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:29,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:29,648 INFO L229 MonitoredProcess]: Starting monitored process 244 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:29,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (244)] Waiting until timeout for monitored process [2025-03-09 06:53:29,650 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:29,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:29,659 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:29,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:29,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:29,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:29,659 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:29,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:29,660 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:29,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (244)] Ended with exit code 0 [2025-03-09 06:53:29,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:29,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:29,667 INFO L229 MonitoredProcess]: Starting monitored process 245 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:29,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (245)] Waiting until timeout for monitored process [2025-03-09 06:53:29,668 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:29,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:29,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:29,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:29,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:29,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:29,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:29,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:29,679 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:29,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (245)] Ended with exit code 0 [2025-03-09 06:53:29,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:29,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:29,686 INFO L229 MonitoredProcess]: Starting monitored process 246 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:29,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (246)] Waiting until timeout for monitored process [2025-03-09 06:53:29,688 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:29,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:29,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:29,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:29,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:29,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:29,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:29,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:29,698 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:29,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (246)] Ended with exit code 0 [2025-03-09 06:53:29,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:29,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:29,705 INFO L229 MonitoredProcess]: Starting monitored process 247 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:29,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (247)] Waiting until timeout for monitored process [2025-03-09 06:53:29,707 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:29,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:29,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:29,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:29,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:29,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:29,716 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:29,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:29,717 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:29,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (247)] Ended with exit code 0 [2025-03-09 06:53:29,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:29,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:29,725 INFO L229 MonitoredProcess]: Starting monitored process 248 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:29,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (248)] Waiting until timeout for monitored process [2025-03-09 06:53:29,726 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:29,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:29,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:29,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:29,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:29,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:29,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:29,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:29,737 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:29,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (248)] Ended with exit code 0 [2025-03-09 06:53:29,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:29,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:29,743 INFO L229 MonitoredProcess]: Starting monitored process 249 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:29,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (249)] Waiting until timeout for monitored process [2025-03-09 06:53:29,745 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:29,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:29,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:29,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:29,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:29,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:29,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:29,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:29,755 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:29,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (249)] Ended with exit code 0 [2025-03-09 06:53:29,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:29,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:29,761 INFO L229 MonitoredProcess]: Starting monitored process 250 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:29,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (250)] Waiting until timeout for monitored process [2025-03-09 06:53:29,763 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:29,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:29,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:29,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:29,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:29,773 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:29,773 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:29,775 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:29,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (250)] Ended with exit code 0 [2025-03-09 06:53:29,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:29,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:29,782 INFO L229 MonitoredProcess]: Starting monitored process 251 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:29,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (251)] Waiting until timeout for monitored process [2025-03-09 06:53:29,783 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:29,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:29,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:29,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:29,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:29,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:29,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:29,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:29,793 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:29,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (251)] Ended with exit code 0 [2025-03-09 06:53:29,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:29,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:29,800 INFO L229 MonitoredProcess]: Starting monitored process 252 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:29,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (252)] Waiting until timeout for monitored process [2025-03-09 06:53:29,802 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:29,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:29,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:29,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:29,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:29,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:29,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:29,811 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:29,812 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:29,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (252)] Ended with exit code 0 [2025-03-09 06:53:29,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:29,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:29,819 INFO L229 MonitoredProcess]: Starting monitored process 253 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:29,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (253)] Waiting until timeout for monitored process [2025-03-09 06:53:29,820 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:29,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:29,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:29,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:29,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:29,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:29,830 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:29,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:29,830 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:29,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (253)] Ended with exit code 0 [2025-03-09 06:53:29,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:29,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:29,838 INFO L229 MonitoredProcess]: Starting monitored process 254 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:29,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (254)] Waiting until timeout for monitored process [2025-03-09 06:53:29,839 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:29,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:29,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:29,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:29,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:29,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:29,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:29,859 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:29,873 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2025-03-09 06:53:29,873 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-09 06:53:29,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:29,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:29,875 INFO L229 MonitoredProcess]: Starting monitored process 255 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:29,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (255)] Waiting until timeout for monitored process [2025-03-09 06:53:29,876 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:29,886 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2025-03-09 06:53:29,887 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:29,887 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)_19) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_19 Supporting invariants [-1*ULTIMATE.start_main_#t~mem16#1 + 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_19 - 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_19 + 1*ULTIMATE.start_main_#t~mem15#1 >= 0, -1*ULTIMATE.start_main_#t~mem16#1 + 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_19 + 1*ULTIMATE.start_main_#t~mem15#1 >= 0] [2025-03-09 06:53:29,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (254)] Ended with exit code 0 [2025-03-09 06:53:29,909 INFO L156 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2025-03-09 06:53:29,911 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:53:29,911 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:53:29,911 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:29,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:29,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:29,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:29,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:29,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:29,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:53:29,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:29,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:29,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:29,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:29,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:29,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 06:53:29,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:29,972 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 42 treesize of output 19 [2025-03-09 06:53:29,974 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 21 treesize of output 13 [2025-03-09 06:53:29,990 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 27 treesize of output 19 [2025-03-09 06:53:29,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:30,028 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 31 treesize of output 23 [2025-03-09 06:53:30,031 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 38 treesize of output 15 [2025-03-09 06:53:30,085 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:30,086 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2025-03-09 06:53:30,086 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2194 states and 2888 transitions. cyclomatic complexity: 787 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:30,268 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2194 states and 2888 transitions. cyclomatic complexity: 787. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 4868 states and 6221 transitions. Complement of second has 22 states. [2025-03-09 06:53:30,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 9 non-accepting loop states 2 accepting loop states [2025-03-09 06:53:30,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 38 transitions. [2025-03-09 06:53:30,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 38 transitions. Stem has 18 letters. Loop has 18 letters. [2025-03-09 06:53:30,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:30,269 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:30,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:30,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:30,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:30,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:30,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:30,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:53:30,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:30,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:30,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:30,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:30,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:30,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 06:53:30,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:30,346 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 42 treesize of output 19 [2025-03-09 06:53:30,348 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 21 treesize of output 13 [2025-03-09 06:53:30,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (255)] Ended with exit code 0 [2025-03-09 06:53:30,363 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 27 treesize of output 19 [2025-03-09 06:53:30,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:30,389 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 31 treesize of output 23 [2025-03-09 06:53:30,390 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 38 treesize of output 15 [2025-03-09 06:53:30,427 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:30,428 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2025-03-09 06:53:30,428 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2194 states and 2888 transitions. cyclomatic complexity: 787 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:30,589 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2194 states and 2888 transitions. cyclomatic complexity: 787. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 5077 states and 6535 transitions. Complement of second has 23 states. [2025-03-09 06:53:30,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:30,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2025-03-09 06:53:30,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 41 transitions. Stem has 18 letters. Loop has 18 letters. [2025-03-09 06:53:30,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:30,590 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:30,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:30,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:30,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:30,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:30,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:30,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:53:30,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:30,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:30,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:30,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:30,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:30,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 06:53:30,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:30,651 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 42 treesize of output 19 [2025-03-09 06:53:30,652 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 21 treesize of output 13 [2025-03-09 06:53:30,663 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 27 treesize of output 19 [2025-03-09 06:53:30,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:30,689 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 31 treesize of output 23 [2025-03-09 06:53:30,691 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 38 treesize of output 15 [2025-03-09 06:53:30,728 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:30,728 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 7 loop predicates [2025-03-09 06:53:30,728 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2194 states and 2888 transitions. cyclomatic complexity: 787 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:30,872 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2194 states and 2888 transitions. cyclomatic complexity: 787. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 5469 states and 7020 transitions. Complement of second has 26 states. [2025-03-09 06:53:30,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 9 non-accepting loop states 2 accepting loop states [2025-03-09 06:53:30,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:30,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 42 transitions. [2025-03-09 06:53:30,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 42 transitions. Stem has 18 letters. Loop has 18 letters. [2025-03-09 06:53:30,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:30,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 42 transitions. Stem has 36 letters. Loop has 18 letters. [2025-03-09 06:53:30,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:30,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 42 transitions. Stem has 18 letters. Loop has 36 letters. [2025-03-09 06:53:30,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:30,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5469 states and 7020 transitions. [2025-03-09 06:53:30,882 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1258 [2025-03-09 06:53:30,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5469 states to 4427 states and 5661 transitions. [2025-03-09 06:53:30,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 343 [2025-03-09 06:53:30,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 363 [2025-03-09 06:53:30,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4427 states and 5661 transitions. [2025-03-09 06:53:30,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:30,893 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4427 states and 5661 transitions. [2025-03-09 06:53:30,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4427 states and 5661 transitions. [2025-03-09 06:53:30,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4427 to 3009. [2025-03-09 06:53:30,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3009 states, 3009 states have (on average 1.3123961448986374) internal successors, (3949), 3008 states have internal predecessors, (3949), 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:30,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3009 states to 3009 states and 3949 transitions. [2025-03-09 06:53:30,924 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3009 states and 3949 transitions. [2025-03-09 06:53:30,924 INFO L432 stractBuchiCegarLoop]: Abstraction has 3009 states and 3949 transitions. [2025-03-09 06:53:30,924 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-03-09 06:53:30,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3009 states and 3949 transitions. [2025-03-09 06:53:30,927 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 946 [2025-03-09 06:53:30,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:30,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:30,927 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:30,927 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:53:30,927 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:30,928 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:30,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:30,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1574637383, now seen corresponding path program 8 times [2025-03-09 06:53:30,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:30,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518500264] [2025-03-09 06:53:30,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:53:30,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:30,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 06:53:30,940 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:30,940 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:53:30,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:30,940 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:30,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:30,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:30,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:30,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:30,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:30,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:30,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1594756551, now seen corresponding path program 2 times [2025-03-09 06:53:30,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:30,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809496502] [2025-03-09 06:53:30,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:53:30,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:30,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 06:53:30,954 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:30,954 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:53:30,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:30,954 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:30,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:30,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:30,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:30,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:30,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:30,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:30,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1417287565, now seen corresponding path program 5 times [2025-03-09 06:53:30,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:30,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843344141] [2025-03-09 06:53:30,961 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:53:30,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:30,970 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 6 equivalence classes. [2025-03-09 06:53:30,979 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:53:30,979 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-09 06:53:30,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:30,980 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:30,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 06:53:30,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:53:30,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:30,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:30,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:32,016 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:32,016 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:32,016 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:32,016 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:32,017 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:32,017 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:32,017 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:32,017 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:32,017 INFO L132 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca-2.i_Iteration21_Lasso [2025-03-09 06:53:32,017 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:32,017 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:32,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:32,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:32,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:32,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:32,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:32,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:32,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:32,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:32,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:32,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:32,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:32,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:32,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:32,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:32,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:32,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:32,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:32,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:32,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:32,294 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:32,294 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:32,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:32,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:32,296 INFO L229 MonitoredProcess]: Starting monitored process 256 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:32,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (256)] Waiting until timeout for monitored process [2025-03-09 06:53:32,298 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:32,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:32,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:32,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:32,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:32,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:32,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:32,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:32,309 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:32,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (256)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:32,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:32,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:32,316 INFO L229 MonitoredProcess]: Starting monitored process 257 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:32,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (257)] Waiting until timeout for monitored process [2025-03-09 06:53:32,318 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:32,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:32,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:32,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:32,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:32,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:32,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:32,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:32,330 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:32,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (257)] Ended with exit code 0 [2025-03-09 06:53:32,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:32,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:32,337 INFO L229 MonitoredProcess]: Starting monitored process 258 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:32,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (258)] Waiting until timeout for monitored process [2025-03-09 06:53:32,339 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:32,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:32,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:32,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:32,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:32,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:32,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:32,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:32,350 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:32,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (258)] Ended with exit code 0 [2025-03-09 06:53:32,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:32,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:32,357 INFO L229 MonitoredProcess]: Starting monitored process 259 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:32,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (259)] Waiting until timeout for monitored process [2025-03-09 06:53:32,359 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:32,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:32,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:32,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:32,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:32,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:32,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:32,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:32,369 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:32,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (259)] Ended with exit code 0 [2025-03-09 06:53:32,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:32,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:32,376 INFO L229 MonitoredProcess]: Starting monitored process 260 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:32,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (260)] Waiting until timeout for monitored process [2025-03-09 06:53:32,377 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:32,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:32,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:32,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:32,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:32,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:32,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:32,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:32,387 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:32,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (260)] Ended with exit code 0 [2025-03-09 06:53:32,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:32,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:32,394 INFO L229 MonitoredProcess]: Starting monitored process 261 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:32,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (261)] Waiting until timeout for monitored process [2025-03-09 06:53:32,397 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:32,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:32,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:32,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:32,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:32,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:32,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:32,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:32,408 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:32,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (261)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:32,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:32,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:32,414 INFO L229 MonitoredProcess]: Starting monitored process 262 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:32,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (262)] Waiting until timeout for monitored process [2025-03-09 06:53:32,416 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:32,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:32,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:32,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:32,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:32,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:32,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:32,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:32,426 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:32,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (262)] Ended with exit code 0 [2025-03-09 06:53:32,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:32,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:32,433 INFO L229 MonitoredProcess]: Starting monitored process 263 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:32,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (263)] Waiting until timeout for monitored process [2025-03-09 06:53:32,435 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:32,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:32,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:32,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:32,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:32,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:32,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:32,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:32,445 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:32,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (263)] Ended with exit code 0 [2025-03-09 06:53:32,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:32,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:32,452 INFO L229 MonitoredProcess]: Starting monitored process 264 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:32,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (264)] Waiting until timeout for monitored process [2025-03-09 06:53:32,453 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:32,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:32,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:32,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:32,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:32,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:32,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:32,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:32,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (264)] Ended with exit code 0 [2025-03-09 06:53:32,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:32,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:32,472 INFO L229 MonitoredProcess]: Starting monitored process 265 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:32,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (265)] Waiting until timeout for monitored process [2025-03-09 06:53:32,474 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:32,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:32,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:32,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:32,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:32,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:32,484 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:32,484 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:32,484 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:32,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (265)] Ended with exit code 0 [2025-03-09 06:53:32,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:32,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:32,491 INFO L229 MonitoredProcess]: Starting monitored process 266 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:32,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (266)] Waiting until timeout for monitored process [2025-03-09 06:53:32,493 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:32,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:32,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:32,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:32,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:32,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:32,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:32,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:32,503 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:32,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (266)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:32,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:32,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:32,511 INFO L229 MonitoredProcess]: Starting monitored process 267 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:32,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (267)] Waiting until timeout for monitored process [2025-03-09 06:53:32,512 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:32,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:32,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:32,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:32,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:32,523 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:32,523 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:32,527 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:32,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (267)] Ended with exit code 0 [2025-03-09 06:53:32,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:32,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:32,533 INFO L229 MonitoredProcess]: Starting monitored process 268 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:32,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (268)] Waiting until timeout for monitored process [2025-03-09 06:53:32,535 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:32,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:32,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:32,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:32,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:32,546 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:32,546 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:32,550 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:32,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (268)] Ended with exit code 0 [2025-03-09 06:53:32,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:32,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:32,557 INFO L229 MonitoredProcess]: Starting monitored process 269 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:32,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (269)] Waiting until timeout for monitored process [2025-03-09 06:53:32,559 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:32,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:32,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:32,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:32,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:32,569 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:32,569 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:32,573 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:32,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (269)] Ended with exit code 0 [2025-03-09 06:53:32,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:32,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:32,580 INFO L229 MonitoredProcess]: Starting monitored process 270 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:32,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (270)] Waiting until timeout for monitored process [2025-03-09 06:53:32,581 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:32,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:32,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:32,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:32,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:32,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:32,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:32,599 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:32,607 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-09 06:53:32,607 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-03-09 06:53:32,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:32,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:32,609 INFO L229 MonitoredProcess]: Starting monitored process 271 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:32,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (271)] Waiting until timeout for monitored process [2025-03-09 06:53:32,610 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:32,620 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2025-03-09 06:53:32,620 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:32,620 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)_20) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_20 + 1 Supporting invariants [-1*ULTIMATE.start_main_#t~mem16#1 + 1*ULTIMATE.start_main_#t~mem15#1 + 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_20 - 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_20 >= 0, 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_20 >= 0] [2025-03-09 06:53:32,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (270)] Ended with exit code 0 [2025-03-09 06:53:32,643 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2025-03-09 06:53:32,644 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:53:32,645 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:53:32,645 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:32,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:32,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:32,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:32,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:32,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:32,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:53:32,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:32,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:32,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:32,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:32,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:32,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 06:53:32,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:32,705 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 42 treesize of output 19 [2025-03-09 06:53:32,707 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 23 treesize of output 15 [2025-03-09 06:53:32,733 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 25 treesize of output 17 [2025-03-09 06:53:32,734 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 38 treesize of output 15 [2025-03-09 06:53:32,752 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 27 treesize of output 19 [2025-03-09 06:53:32,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:32,790 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:32,790 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2025-03-09 06:53:32,791 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3009 states and 3949 transitions. cyclomatic complexity: 1053 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:32,936 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3009 states and 3949 transitions. cyclomatic complexity: 1053. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 5876 states and 7359 transitions. Complement of second has 20 states. [2025-03-09 06:53:32,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 8 non-accepting loop states 2 accepting loop states [2025-03-09 06:53:32,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:32,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2025-03-09 06:53:32,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 37 transitions. Stem has 18 letters. Loop has 18 letters. [2025-03-09 06:53:32,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:32,938 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:32,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:32,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:32,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:32,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:32,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:32,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:53:32,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:32,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:33,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:33,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:33,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:33,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 06:53:33,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:33,014 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 42 treesize of output 19 [2025-03-09 06:53:33,015 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 23 treesize of output 15 [2025-03-09 06:53:33,040 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 25 treesize of output 17 [2025-03-09 06:53:33,041 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 38 treesize of output 15 [2025-03-09 06:53:33,054 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 27 treesize of output 19 [2025-03-09 06:53:33,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:33,095 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:33,095 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2025-03-09 06:53:33,095 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3009 states and 3949 transitions. cyclomatic complexity: 1053 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:33,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (271)] Ended with exit code 0 [2025-03-09 06:53:33,256 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3009 states and 3949 transitions. cyclomatic complexity: 1053. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 6295 states and 7922 transitions. Complement of second has 19 states. [2025-03-09 06:53:33,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:33,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:33,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2025-03-09 06:53:33,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 39 transitions. Stem has 18 letters. Loop has 18 letters. [2025-03-09 06:53:33,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:33,257 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:33,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:33,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:33,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:33,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:33,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:33,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:53:33,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:33,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:33,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:33,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:33,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:33,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 06:53:33,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:33,340 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 42 treesize of output 19 [2025-03-09 06:53:33,344 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 23 treesize of output 15 [2025-03-09 06:53:33,374 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 25 treesize of output 17 [2025-03-09 06:53:33,376 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 38 treesize of output 15 [2025-03-09 06:53:33,389 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 27 treesize of output 19 [2025-03-09 06:53:33,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:33,425 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:33,426 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 7 loop predicates [2025-03-09 06:53:33,426 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3009 states and 3949 transitions. cyclomatic complexity: 1053 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:33,570 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3009 states and 3949 transitions. cyclomatic complexity: 1053. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 10063 states and 12403 transitions. Complement of second has 28 states. [2025-03-09 06:53:33,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 8 non-accepting loop states 2 accepting loop states [2025-03-09 06:53:33,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:33,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2025-03-09 06:53:33,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 41 transitions. Stem has 18 letters. Loop has 18 letters. [2025-03-09 06:53:33,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:33,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 41 transitions. Stem has 36 letters. Loop has 18 letters. [2025-03-09 06:53:33,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:33,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 41 transitions. Stem has 18 letters. Loop has 36 letters. [2025-03-09 06:53:33,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:33,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10063 states and 12403 transitions. [2025-03-09 06:53:33,590 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 2321 [2025-03-09 06:53:33,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10063 states to 6375 states and 8047 transitions. [2025-03-09 06:53:33,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 450 [2025-03-09 06:53:33,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 473 [2025-03-09 06:53:33,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6375 states and 8047 transitions. [2025-03-09 06:53:33,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:33,608 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6375 states and 8047 transitions. [2025-03-09 06:53:33,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6375 states and 8047 transitions. [2025-03-09 06:53:33,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6375 to 4145. [2025-03-09 06:53:33,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4145 states, 4145 states have (on average 1.3358262967430639) internal successors, (5537), 4144 states have internal predecessors, (5537), 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:33,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4145 states to 4145 states and 5537 transitions. [2025-03-09 06:53:33,651 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4145 states and 5537 transitions. [2025-03-09 06:53:33,651 INFO L432 stractBuchiCegarLoop]: Abstraction has 4145 states and 5537 transitions. [2025-03-09 06:53:33,651 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-03-09 06:53:33,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4145 states and 5537 transitions. [2025-03-09 06:53:33,655 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1464 [2025-03-09 06:53:33,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:33,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:33,657 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:33,657 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1] [2025-03-09 06:53:33,657 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:33,657 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:33,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:33,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1574637383, now seen corresponding path program 9 times [2025-03-09 06:53:33,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:33,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770382729] [2025-03-09 06:53:33,657 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:53:33,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:33,664 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-03-09 06:53:33,669 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:33,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 06:53:33,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:33,670 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:33,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:33,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:33,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:33,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:33,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:33,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:33,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1580311676, now seen corresponding path program 3 times [2025-03-09 06:53:33,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:33,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934397841] [2025-03-09 06:53:33,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:53:33,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:33,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 3 equivalence classes. [2025-03-09 06:53:33,689 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:53:33,689 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 06:53:33,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:33,689 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:33,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:53:33,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:53:33,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:33,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:33,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:33,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:33,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1799044670, now seen corresponding path program 6 times [2025-03-09 06:53:33,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:33,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363939847] [2025-03-09 06:53:33,696 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:53:33,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:33,705 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 7 equivalence classes. [2025-03-09 06:53:33,714 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 06:53:33,714 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-09 06:53:33,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:33,714 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:33,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 06:53:33,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 06:53:33,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:33,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:33,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:35,168 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:35,168 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:35,168 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:35,168 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:35,168 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:35,168 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:35,168 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:35,168 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:35,168 INFO L132 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca-2.i_Iteration22_Lasso [2025-03-09 06:53:35,168 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:35,168 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:35,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:35,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:35,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:35,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:35,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:35,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:35,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:35,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:35,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:35,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:35,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:35,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:35,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:35,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:35,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:35,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:35,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:35,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:35,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:35,500 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:35,500 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:35,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:35,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:35,502 INFO L229 MonitoredProcess]: Starting monitored process 272 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:35,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (272)] Waiting until timeout for monitored process [2025-03-09 06:53:35,503 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:35,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:35,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:35,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:35,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:35,515 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:35,515 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:35,522 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:35,543 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2025-03-09 06:53:35,543 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2025-03-09 06:53:35,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:35,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:35,545 INFO L229 MonitoredProcess]: Starting monitored process 273 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:35,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (273)] Waiting until timeout for monitored process [2025-03-09 06:53:35,546 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:35,556 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2025-03-09 06:53:35,556 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:35,556 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem16#1) = 1*ULTIMATE.start_main_#t~mem16#1 Supporting invariants [-1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_21 + 1*ULTIMATE.start_main_#t~mem15#1 >= 0, 1*ULTIMATE.start_main_#t~mem15#1 >= 0] [2025-03-09 06:53:35,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (272)] Ended with exit code 0 [2025-03-09 06:53:35,579 INFO L156 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2025-03-09 06:53:35,580 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem16 [2025-03-09 06:53:35,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:35,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:35,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:35,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:35,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:35,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 06:53:35,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:35,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:53:35,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:53:35,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:35,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:35,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 06:53:35,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:35,660 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 38 treesize of output 15 [2025-03-09 06:53:35,694 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 25 treesize of output 17 [2025-03-09 06:53:35,696 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 38 treesize of output 15 [2025-03-09 06:53:35,716 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 27 treesize of output 19 [2025-03-09 06:53:35,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:35,761 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 31 treesize of output 23 [2025-03-09 06:53:35,763 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 38 treesize of output 15 [2025-03-09 06:53:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:35,808 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2025-03-09 06:53:35,808 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4145 states and 5537 transitions. cyclomatic complexity: 1526 Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:36,084 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4145 states and 5537 transitions. cyclomatic complexity: 1526. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 11344 states and 14659 transitions. Complement of second has 31 states. [2025-03-09 06:53:36,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:36,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:36,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 53 transitions. [2025-03-09 06:53:36,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 53 transitions. Stem has 18 letters. Loop has 24 letters. [2025-03-09 06:53:36,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:36,085 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:36,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:36,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:36,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:36,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:36,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:36,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 06:53:36,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:36,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:53:36,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:53:36,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:36,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:36,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 06:53:36,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:36,157 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 38 treesize of output 15 [2025-03-09 06:53:36,205 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 25 treesize of output 17 [2025-03-09 06:53:36,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (273)] Ended with exit code 0 [2025-03-09 06:53:36,208 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 38 treesize of output 15 [2025-03-09 06:53:36,223 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 27 treesize of output 19 [2025-03-09 06:53:36,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:36,258 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 31 treesize of output 23 [2025-03-09 06:53:36,259 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 38 treesize of output 15 [2025-03-09 06:53:36,299 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:36,300 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2025-03-09 06:53:36,300 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4145 states and 5537 transitions. cyclomatic complexity: 1526 Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:36,540 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4145 states and 5537 transitions. cyclomatic complexity: 1526. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 11344 states and 14659 transitions. Complement of second has 31 states. [2025-03-09 06:53:36,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:36,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:36,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 53 transitions. [2025-03-09 06:53:36,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 53 transitions. Stem has 18 letters. Loop has 24 letters. [2025-03-09 06:53:36,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:36,541 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:36,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:36,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:36,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:36,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:36,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:36,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 06:53:36,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:36,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:53:36,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:53:36,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:36,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:36,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 06:53:36,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:36,610 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 38 treesize of output 15 [2025-03-09 06:53:36,641 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 25 treesize of output 17 [2025-03-09 06:53:36,643 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 38 treesize of output 15 [2025-03-09 06:53:36,659 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 27 treesize of output 19 [2025-03-09 06:53:36,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:36,695 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 31 treesize of output 23 [2025-03-09 06:53:36,697 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 38 treesize of output 15 [2025-03-09 06:53:36,749 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:36,750 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 9 loop predicates [2025-03-09 06:53:36,750 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4145 states and 5537 transitions. cyclomatic complexity: 1526 Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:37,040 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4145 states and 5537 transitions. cyclomatic complexity: 1526. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 15942 states and 20466 transitions. Complement of second has 40 states. [2025-03-09 06:53:37,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:37,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 57 transitions. [2025-03-09 06:53:37,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 57 transitions. Stem has 18 letters. Loop has 24 letters. [2025-03-09 06:53:37,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:37,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 57 transitions. Stem has 42 letters. Loop has 24 letters. [2025-03-09 06:53:37,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:37,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 57 transitions. Stem has 18 letters. Loop has 48 letters. [2025-03-09 06:53:37,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:37,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15942 states and 20466 transitions. [2025-03-09 06:53:37,079 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 5103 [2025-03-09 06:53:37,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15942 states to 11880 states and 15163 transitions. [2025-03-09 06:53:37,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 675 [2025-03-09 06:53:37,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 730 [2025-03-09 06:53:37,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11880 states and 15163 transitions. [2025-03-09 06:53:37,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:37,107 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11880 states and 15163 transitions. [2025-03-09 06:53:37,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11880 states and 15163 transitions. [2025-03-09 06:53:37,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11880 to 7825. [2025-03-09 06:53:37,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7825 states, 7825 states have (on average 1.335335463258786) internal successors, (10449), 7824 states have internal predecessors, (10449), 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:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7825 states to 7825 states and 10449 transitions. [2025-03-09 06:53:37,239 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7825 states and 10449 transitions. [2025-03-09 06:53:37,239 INFO L432 stractBuchiCegarLoop]: Abstraction has 7825 states and 10449 transitions. [2025-03-09 06:53:37,239 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-03-09 06:53:37,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7825 states and 10449 transitions. [2025-03-09 06:53:37,247 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 3564 [2025-03-09 06:53:37,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:37,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:37,248 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:37,248 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 1, 1, 1] [2025-03-09 06:53:37,248 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:37,248 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:37,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:37,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1574637383, now seen corresponding path program 10 times [2025-03-09 06:53:37,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:37,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200201313] [2025-03-09 06:53:37,249 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:53:37,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:37,255 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-09 06:53:37,259 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:37,259 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:53:37,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:37,259 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:37,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:37,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:37,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:37,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:37,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:37,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:37,265 INFO L85 PathProgramCache]: Analyzing trace with hash 235354841, now seen corresponding path program 4 times [2025-03-09 06:53:37,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:37,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861088514] [2025-03-09 06:53:37,266 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:53:37,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:37,273 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-03-09 06:53:37,278 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:53:37,279 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:53:37,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:37,279 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:37,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:53:37,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:53:37,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:37,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:37,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:37,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:37,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1150965791, now seen corresponding path program 7 times [2025-03-09 06:53:37,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:37,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082615927] [2025-03-09 06:53:37,287 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:53:37,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:37,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 06:53:37,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 06:53:37,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:37,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:37,304 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:37,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 06:53:37,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 06:53:37,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:37,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:37,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:38,677 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:38,677 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:38,677 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:38,677 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:38,677 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:38,677 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:38,677 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:38,677 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:38,677 INFO L132 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca-2.i_Iteration23_Lasso [2025-03-09 06:53:38,677 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:38,677 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:38,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:38,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:38,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:38,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:38,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:38,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:38,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:38,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:38,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:38,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:38,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:38,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:38,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:38,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:38,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:38,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:38,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:38,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:38,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:39,008 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:39,008 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:39,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:39,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:39,010 INFO L229 MonitoredProcess]: Starting monitored process 274 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:39,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (274)] Waiting until timeout for monitored process [2025-03-09 06:53:39,013 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:39,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:39,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:39,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:39,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:39,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:39,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:39,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:39,023 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:39,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (274)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:39,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:39,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:39,031 INFO L229 MonitoredProcess]: Starting monitored process 275 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:39,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (275)] Waiting until timeout for monitored process [2025-03-09 06:53:39,032 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:39,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:39,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:39,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:39,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:39,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:39,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:39,044 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:39,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (275)] Ended with exit code 0 [2025-03-09 06:53:39,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:39,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:39,051 INFO L229 MonitoredProcess]: Starting monitored process 276 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:39,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (276)] Waiting until timeout for monitored process [2025-03-09 06:53:39,053 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:39,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:39,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:39,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:39,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:39,064 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:39,064 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:39,067 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:39,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (276)] Ended with exit code 0 [2025-03-09 06:53:39,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:39,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:39,074 INFO L229 MonitoredProcess]: Starting monitored process 277 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:39,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (277)] Waiting until timeout for monitored process [2025-03-09 06:53:39,076 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:39,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:39,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:39,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:39,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:39,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:39,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:39,091 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:39,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (277)] Ended with exit code 0 [2025-03-09 06:53:39,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:39,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:39,099 INFO L229 MonitoredProcess]: Starting monitored process 278 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:39,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (278)] Waiting until timeout for monitored process [2025-03-09 06:53:39,101 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:39,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:39,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:39,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:39,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:39,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:39,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:39,124 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:39,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (278)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:39,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:39,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:39,132 INFO L229 MonitoredProcess]: Starting monitored process 279 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:39,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (279)] Waiting until timeout for monitored process [2025-03-09 06:53:39,135 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:39,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:39,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:39,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:39,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:39,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:39,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:39,151 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:39,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (279)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:39,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:39,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:39,158 INFO L229 MonitoredProcess]: Starting monitored process 280 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:39,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (280)] Waiting until timeout for monitored process [2025-03-09 06:53:39,160 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:39,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:39,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:39,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:39,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:39,175 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:39,175 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:39,183 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:39,203 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-03-09 06:53:39,204 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2025-03-09 06:53:39,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:39,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:39,206 INFO L229 MonitoredProcess]: Starting monitored process 281 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:39,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (281)] Waiting until timeout for monitored process [2025-03-09 06:53:39,208 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:39,218 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2025-03-09 06:53:39,219 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:39,219 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem16#1) = 1*ULTIMATE.start_main_#t~mem16#1 Supporting invariants [1*ULTIMATE.start_main_#t~mem15#1 >= 0, -1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) 0)_8 + 1*ULTIMATE.start_main_#t~mem15#1 >= 0] [2025-03-09 06:53:39,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (280)] Ended with exit code 0 [2025-03-09 06:53:39,254 INFO L156 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2025-03-09 06:53:39,257 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem16 [2025-03-09 06:53:39,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:39,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:39,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:39,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:39,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:39,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:53:39,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:39,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:39,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:53:39,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:53:39,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:39,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:39,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 06:53:39,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:39,366 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 38 treesize of output 15 [2025-03-09 06:53:39,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-09 06:53:39,389 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 23 treesize of output 15 [2025-03-09 06:53:39,426 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 40 treesize of output 28 [2025-03-09 06:53:39,428 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 23 treesize of output 15 [2025-03-09 06:53:39,466 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 40 treesize of output 28 [2025-03-09 06:53:39,467 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 23 treesize of output 15 [2025-03-09 06:53:39,517 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:39,518 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2025-03-09 06:53:39,518 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7825 states and 10449 transitions. cyclomatic complexity: 2846 Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:39,828 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7825 states and 10449 transitions. cyclomatic complexity: 2846. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21679 states and 28556 transitions. Complement of second has 32 states. [2025-03-09 06:53:39,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 2 stem states 14 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:39,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:39,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 53 transitions. [2025-03-09 06:53:39,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 53 transitions. Stem has 18 letters. Loop has 24 letters. [2025-03-09 06:53:39,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:39,829 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:39,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:39,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:39,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:39,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:39,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:39,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:53:39,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:39,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:39,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:53:39,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:53:39,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:39,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:39,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 06:53:39,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:39,916 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 38 treesize of output 15 [2025-03-09 06:53:39,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-09 06:53:39,938 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 23 treesize of output 15 [2025-03-09 06:53:39,979 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 40 treesize of output 28 [2025-03-09 06:53:39,980 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 23 treesize of output 15 [2025-03-09 06:53:40,023 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 40 treesize of output 28 [2025-03-09 06:53:40,025 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 23 treesize of output 15 [2025-03-09 06:53:40,086 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:40,086 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2025-03-09 06:53:40,086 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7825 states and 10449 transitions. cyclomatic complexity: 2846 Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:40,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (281)] Ended with exit code 0 [2025-03-09 06:53:40,442 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7825 states and 10449 transitions. cyclomatic complexity: 2846. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21679 states and 28556 transitions. Complement of second has 32 states. [2025-03-09 06:53:40,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 2 stem states 14 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:40,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:40,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 53 transitions. [2025-03-09 06:53:40,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 53 transitions. Stem has 18 letters. Loop has 24 letters. [2025-03-09 06:53:40,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:40,443 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:40,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:40,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:40,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:40,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:40,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:40,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:53:40,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:40,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:40,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:53:40,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:53:40,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:40,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:40,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 06:53:40,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:40,552 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 38 treesize of output 15 [2025-03-09 06:53:40,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-09 06:53:40,580 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 23 treesize of output 15 [2025-03-09 06:53:40,619 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 40 treesize of output 28 [2025-03-09 06:53:40,620 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 23 treesize of output 15 [2025-03-09 06:53:40,662 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 40 treesize of output 28 [2025-03-09 06:53:40,664 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 23 treesize of output 15 [2025-03-09 06:53:40,721 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:40,721 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 9 loop predicates [2025-03-09 06:53:40,721 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7825 states and 10449 transitions. cyclomatic complexity: 2846 Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:41,023 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7825 states and 10449 transitions. cyclomatic complexity: 2846. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 22007 states and 29653 transitions. Complement of second has 39 states. [2025-03-09 06:53:41,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 2 stem states 14 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:41,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:41,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 57 transitions. [2025-03-09 06:53:41,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 57 transitions. Stem has 18 letters. Loop has 24 letters. [2025-03-09 06:53:41,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:41,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 57 transitions. Stem has 42 letters. Loop has 24 letters. [2025-03-09 06:53:41,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:41,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 57 transitions. Stem has 18 letters. Loop has 48 letters. [2025-03-09 06:53:41,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:41,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22007 states and 29653 transitions. [2025-03-09 06:53:41,082 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 7746 [2025-03-09 06:53:41,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22007 states to 16809 states and 22271 transitions. [2025-03-09 06:53:41,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 819 [2025-03-09 06:53:41,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 845 [2025-03-09 06:53:41,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16809 states and 22271 transitions. [2025-03-09 06:53:41,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:41,120 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16809 states and 22271 transitions. [2025-03-09 06:53:41,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16809 states and 22271 transitions. [2025-03-09 06:53:41,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16809 to 14094. [2025-03-09 06:53:41,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14094 states, 14094 states have (on average 1.334042855115652) internal successors, (18802), 14093 states have internal predecessors, (18802), 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:41,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14094 states to 14094 states and 18802 transitions. [2025-03-09 06:53:41,311 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14094 states and 18802 transitions. [2025-03-09 06:53:41,311 INFO L432 stractBuchiCegarLoop]: Abstraction has 14094 states and 18802 transitions. [2025-03-09 06:53:41,311 INFO L338 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-03-09 06:53:41,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14094 states and 18802 transitions. [2025-03-09 06:53:41,332 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 6573 [2025-03-09 06:53:41,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:41,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:41,332 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:41,332 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 1] [2025-03-09 06:53:41,333 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:41,333 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:41,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:41,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1574637383, now seen corresponding path program 11 times [2025-03-09 06:53:41,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:41,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884479896] [2025-03-09 06:53:41,333 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:53:41,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:41,340 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 3 equivalence classes. [2025-03-09 06:53:41,343 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:41,344 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 06:53:41,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:41,344 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:41,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:41,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:41,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:41,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:41,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:41,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:41,351 INFO L85 PathProgramCache]: Analyzing trace with hash -481901164, now seen corresponding path program 4 times [2025-03-09 06:53:41,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:41,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745897957] [2025-03-09 06:53:41,351 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:53:41,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:41,358 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-09 06:53:41,364 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:53:41,364 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:53:41,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:41,364 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:41,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:53:41,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:53:41,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:41,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:41,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:41,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:41,373 INFO L85 PathProgramCache]: Analyzing trace with hash 725898842, now seen corresponding path program 8 times [2025-03-09 06:53:41,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:41,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224991409] [2025-03-09 06:53:41,374 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:53:41,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:41,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-09 06:53:41,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 06:53:41,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:53:41,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:41,394 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:41,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 06:53:41,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 06:53:41,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:41,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:41,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:43,746 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:43,746 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:43,746 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:43,746 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:43,746 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:43,746 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:43,746 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:43,746 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:43,746 INFO L132 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca-2.i_Iteration24_Lasso [2025-03-09 06:53:43,746 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:43,746 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:43,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:43,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:43,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:43,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:43,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:43,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:43,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:43,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:43,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:43,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:43,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:43,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:43,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:43,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:43,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:43,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:43,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:43,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:43,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:44,130 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:44,130 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:44,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:44,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:44,132 INFO L229 MonitoredProcess]: Starting monitored process 282 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:44,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (282)] Waiting until timeout for monitored process [2025-03-09 06:53:44,134 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:44,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:44,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:44,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:44,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:44,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:44,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:44,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:44,145 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:44,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (282)] Ended with exit code 0 [2025-03-09 06:53:44,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:44,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:44,151 INFO L229 MonitoredProcess]: Starting monitored process 283 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:44,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (283)] Waiting until timeout for monitored process [2025-03-09 06:53:44,153 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:44,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:44,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:44,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:44,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:44,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:44,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:44,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:44,163 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:44,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (283)] Ended with exit code 0 [2025-03-09 06:53:44,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:44,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:44,170 INFO L229 MonitoredProcess]: Starting monitored process 284 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:44,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (284)] Waiting until timeout for monitored process [2025-03-09 06:53:44,171 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:44,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:44,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:44,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:44,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:44,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:44,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:44,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:44,182 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:44,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (284)] Ended with exit code 0 [2025-03-09 06:53:44,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:44,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:44,188 INFO L229 MonitoredProcess]: Starting monitored process 285 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:44,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (285)] Waiting until timeout for monitored process [2025-03-09 06:53:44,189 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:44,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:44,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:44,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:44,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:44,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:44,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:44,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:44,200 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:44,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (285)] Ended with exit code 0 [2025-03-09 06:53:44,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:44,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:44,206 INFO L229 MonitoredProcess]: Starting monitored process 286 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:44,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (286)] Waiting until timeout for monitored process [2025-03-09 06:53:44,208 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:44,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:44,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:44,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:44,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:44,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:44,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:44,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:44,219 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:44,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (286)] Ended with exit code 0 [2025-03-09 06:53:44,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:44,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:44,226 INFO L229 MonitoredProcess]: Starting monitored process 287 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:44,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (287)] Waiting until timeout for monitored process [2025-03-09 06:53:44,227 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:44,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:44,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:44,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:44,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:44,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:44,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:44,237 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:44,238 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:44,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (287)] Ended with exit code 0 [2025-03-09 06:53:44,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:44,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:44,244 INFO L229 MonitoredProcess]: Starting monitored process 288 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:44,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (288)] Waiting until timeout for monitored process [2025-03-09 06:53:44,246 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:44,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:44,255 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:44,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:44,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:44,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:44,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:44,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:44,256 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:44,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (288)] Ended with exit code 0 [2025-03-09 06:53:44,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:44,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:44,262 INFO L229 MonitoredProcess]: Starting monitored process 289 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:44,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (289)] Waiting until timeout for monitored process [2025-03-09 06:53:44,264 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:44,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:44,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:44,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:44,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:44,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:44,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:44,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:44,274 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:44,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (289)] Ended with exit code 0 [2025-03-09 06:53:44,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:44,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:44,281 INFO L229 MonitoredProcess]: Starting monitored process 290 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:44,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (290)] Waiting until timeout for monitored process [2025-03-09 06:53:44,282 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:44,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:44,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:44,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:44,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:44,292 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:44,292 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:44,294 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:44,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (290)] Ended with exit code 0 [2025-03-09 06:53:44,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:44,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:44,301 INFO L229 MonitoredProcess]: Starting monitored process 291 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:44,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (291)] Waiting until timeout for monitored process [2025-03-09 06:53:44,302 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:44,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:44,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:44,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:44,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:44,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:44,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:44,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:44,313 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:44,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (291)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:44,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:44,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:44,320 INFO L229 MonitoredProcess]: Starting monitored process 292 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:44,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (292)] Waiting until timeout for monitored process [2025-03-09 06:53:44,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:44,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:44,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:44,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:44,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:44,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:44,331 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:44,331 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:44,332 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:44,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (292)] Ended with exit code 0 [2025-03-09 06:53:44,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:44,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:44,338 INFO L229 MonitoredProcess]: Starting monitored process 293 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:44,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (293)] Waiting until timeout for monitored process [2025-03-09 06:53:44,340 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:44,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:44,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:44,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:44,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:44,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:44,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:44,352 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:44,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (293)] Ended with exit code 0 [2025-03-09 06:53:44,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:44,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:44,359 INFO L229 MonitoredProcess]: Starting monitored process 294 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:44,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (294)] Waiting until timeout for monitored process [2025-03-09 06:53:44,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:44,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:44,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:44,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:44,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:44,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:44,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:44,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:44,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:44,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (294)] Ended with exit code 0 [2025-03-09 06:53:44,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:44,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:44,377 INFO L229 MonitoredProcess]: Starting monitored process 295 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:44,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (295)] Waiting until timeout for monitored process [2025-03-09 06:53:44,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:44,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:44,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:44,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:44,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:44,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:44,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:44,391 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:44,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (295)] Ended with exit code 0 [2025-03-09 06:53:44,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:44,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:44,398 INFO L229 MonitoredProcess]: Starting monitored process 296 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:44,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (296)] Waiting until timeout for monitored process [2025-03-09 06:53:44,399 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:44,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:44,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:44,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:44,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:44,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:44,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:44,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:44,410 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:44,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (296)] Ended with exit code 0 [2025-03-09 06:53:44,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:44,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:44,416 INFO L229 MonitoredProcess]: Starting monitored process 297 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:44,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (297)] Waiting until timeout for monitored process [2025-03-09 06:53:44,418 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:44,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:44,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:44,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:44,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:44,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:44,427 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:44,427 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:44,428 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:44,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (297)] Ended with exit code 0 [2025-03-09 06:53:44,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:44,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:44,435 INFO L229 MonitoredProcess]: Starting monitored process 298 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:44,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (298)] Waiting until timeout for monitored process [2025-03-09 06:53:44,437 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:44,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:44,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:44,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:44,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:44,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:44,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:44,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:44,447 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:44,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (298)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:44,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:44,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:44,454 INFO L229 MonitoredProcess]: Starting monitored process 299 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:44,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (299)] Waiting until timeout for monitored process [2025-03-09 06:53:44,455 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:44,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:44,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:44,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:44,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:44,466 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:44,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:44,469 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:44,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (299)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:44,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:44,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:44,476 INFO L229 MonitoredProcess]: Starting monitored process 300 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:44,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (300)] Waiting until timeout for monitored process [2025-03-09 06:53:44,477 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:44,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:44,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:44,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:44,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:44,490 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:44,490 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:44,498 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:44,513 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-09 06:53:44,513 INFO L444 ModelExtractionUtils]: 2 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. [2025-03-09 06:53:44,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:44,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:44,515 INFO L229 MonitoredProcess]: Starting monitored process 301 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:44,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (301)] Waiting until timeout for monitored process [2025-03-09 06:53:44,516 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:44,527 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:53:44,527 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:44,527 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem15#1, v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) 0)_9, ULTIMATE.start_main_#t~mem16#1) = -1*ULTIMATE.start_main_#t~mem15#1 + 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) 0)_9 + 1*ULTIMATE.start_main_#t~mem16#1 Supporting invariants [] [2025-03-09 06:53:44,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (300)] Ended with exit code 0 [2025-03-09 06:53:44,550 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2025-03-09 06:53:44,552 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 06:53:44,552 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 06:53:44,552 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:44,552 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem15 [2025-03-09 06:53:44,552 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem16 [2025-03-09 06:53:44,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:44,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:44,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:44,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:44,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:44,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:53:44,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:44,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:53:44,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:53:44,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:44,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:44,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 06:53:44,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:44,634 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 38 treesize of output 15 [2025-03-09 06:53:44,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-09 06:53:44,656 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 23 treesize of output 15 [2025-03-09 06:53:44,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:44,678 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 23 treesize of output 15 [2025-03-09 06:53:44,715 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 25 treesize of output 17 [2025-03-09 06:53:44,718 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 38 treesize of output 15 [2025-03-09 06:53:44,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-09 06:53:44,741 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 23 treesize of output 15 [2025-03-09 06:53:44,790 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 21 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:44,790 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2025-03-09 06:53:44,791 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14094 states and 18802 transitions. cyclomatic complexity: 5050 Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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:45,187 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14094 states and 18802 transitions. cyclomatic complexity: 5050. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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 36324 states and 46589 transitions. Complement of second has 32 states. [2025-03-09 06:53:45,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 2 stem states 14 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:45,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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:45,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 61 transitions. [2025-03-09 06:53:45,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 61 transitions. Stem has 18 letters. Loop has 30 letters. [2025-03-09 06:53:45,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:45,188 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:45,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:45,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:45,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (301)] Ended with exit code 0 [2025-03-09 06:53:45,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:45,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:45,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:45,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:53:45,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:45,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:53:45,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:53:45,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:45,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:45,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 06:53:45,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:45,304 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 38 treesize of output 15 [2025-03-09 06:53:45,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-09 06:53:45,331 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 23 treesize of output 15 [2025-03-09 06:53:45,351 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 23 treesize of output 15 [2025-03-09 06:53:45,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:45,389 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 25 treesize of output 17 [2025-03-09 06:53:45,391 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 38 treesize of output 15 [2025-03-09 06:53:45,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-09 06:53:45,426 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 23 treesize of output 15 [2025-03-09 06:53:45,478 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 21 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:45,479 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2025-03-09 06:53:45,479 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14094 states and 18802 transitions. cyclomatic complexity: 5050 Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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:45,846 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14094 states and 18802 transitions. cyclomatic complexity: 5050. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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 36324 states and 46589 transitions. Complement of second has 32 states. [2025-03-09 06:53:45,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 2 stem states 14 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:45,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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:45,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 61 transitions. [2025-03-09 06:53:45,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 61 transitions. Stem has 18 letters. Loop has 30 letters. [2025-03-09 06:53:45,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:45,847 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:45,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:45,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:45,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:45,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:45,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:45,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:53:45,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:45,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:53:45,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:53:45,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:45,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:45,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 06:53:45,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:45,934 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 38 treesize of output 15 [2025-03-09 06:53:45,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-09 06:53:45,955 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 23 treesize of output 15 [2025-03-09 06:53:45,976 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 23 treesize of output 15 [2025-03-09 06:53:45,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:46,012 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 25 treesize of output 17 [2025-03-09 06:53:46,014 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 38 treesize of output 15 [2025-03-09 06:53:46,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-09 06:53:46,038 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 23 treesize of output 15 [2025-03-09 06:53:46,085 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 21 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:46,085 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 9 loop predicates [2025-03-09 06:53:46,085 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14094 states and 18802 transitions. cyclomatic complexity: 5050 Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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:46,505 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14094 states and 18802 transitions. cyclomatic complexity: 5050. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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 49436 states and 63920 transitions. Complement of second has 58 states. [2025-03-09 06:53:46,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 2 stem states 14 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:46,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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:46,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 65 transitions. [2025-03-09 06:53:46,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 65 transitions. Stem has 18 letters. Loop has 30 letters. [2025-03-09 06:53:46,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:46,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 65 transitions. Stem has 48 letters. Loop has 30 letters. [2025-03-09 06:53:46,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:46,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 65 transitions. Stem has 18 letters. Loop has 60 letters. [2025-03-09 06:53:46,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:46,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49436 states and 63920 transitions. [2025-03-09 06:53:46,627 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 20956 [2025-03-09 06:53:46,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49436 states to 35323 states and 45776 transitions. [2025-03-09 06:53:46,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1096 [2025-03-09 06:53:46,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1245 [2025-03-09 06:53:46,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35323 states and 45776 transitions. [2025-03-09 06:53:46,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:46,699 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35323 states and 45776 transitions. [2025-03-09 06:53:46,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35323 states and 45776 transitions. [2025-03-09 06:53:46,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35323 to 25546. [2025-03-09 06:53:46,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25546 states, 25546 states have (on average 1.3315587567525249) internal successors, (34016), 25545 states have internal predecessors, (34016), 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:47,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25546 states to 25546 states and 34016 transitions. [2025-03-09 06:53:47,030 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25546 states and 34016 transitions. [2025-03-09 06:53:47,030 INFO L432 stractBuchiCegarLoop]: Abstraction has 25546 states and 34016 transitions. [2025-03-09 06:53:47,031 INFO L338 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-03-09 06:53:47,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25546 states and 34016 transitions. [2025-03-09 06:53:47,074 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 15129 [2025-03-09 06:53:47,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:47,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:47,075 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:47,075 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 6, 4, 4, 4, 2, 2, 1, 1] [2025-03-09 06:53:47,075 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:47,075 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:47,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:47,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1574637383, now seen corresponding path program 12 times [2025-03-09 06:53:47,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:47,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029167749] [2025-03-09 06:53:47,076 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:53:47,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:47,082 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 3 equivalence classes. [2025-03-09 06:53:47,086 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:47,086 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-09 06:53:47,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:47,086 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:47,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:47,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:47,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:47,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:47,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:47,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:47,094 INFO L85 PathProgramCache]: Analyzing trace with hash -2021662362, now seen corresponding path program 5 times [2025-03-09 06:53:47,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:47,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136357780] [2025-03-09 06:53:47,094 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:53:47,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:47,103 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 5 equivalence classes. [2025-03-09 06:53:47,110 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:53:47,111 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-09 06:53:47,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:47,111 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:47,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 06:53:47,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:53:47,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:47,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:47,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:47,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:47,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1994177108, now seen corresponding path program 9 times [2025-03-09 06:53:47,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:47,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212054412] [2025-03-09 06:53:47,121 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:53:47,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:47,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 7 equivalence classes. [2025-03-09 06:53:47,143 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 06:53:47,144 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-09 06:53:47,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:47,144 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:47,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 06:53:47,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 06:53:47,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:47,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:47,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:51,483 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:51,483 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:51,483 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:51,483 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:51,483 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:51,484 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:51,484 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:51,484 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:51,484 INFO L132 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca-2.i_Iteration25_Lasso [2025-03-09 06:53:51,484 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:51,484 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:51,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:51,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:51,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:51,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:51,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:51,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:51,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:51,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:51,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:51,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:51,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:51,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:51,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:51,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:51,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:51,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:51,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:51,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:51,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:51,789 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:51,789 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:51,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:51,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:51,791 INFO L229 MonitoredProcess]: Starting monitored process 302 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:51,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (302)] Waiting until timeout for monitored process [2025-03-09 06:53:51,793 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:51,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:51,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:51,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:51,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:51,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:51,803 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:51,803 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:51,804 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:51,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (302)] Ended with exit code 0 [2025-03-09 06:53:51,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:51,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:51,810 INFO L229 MonitoredProcess]: Starting monitored process 303 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:51,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (303)] Waiting until timeout for monitored process [2025-03-09 06:53:51,811 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:51,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:51,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:51,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:51,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:51,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:51,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:51,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:51,823 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:51,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (303)] Ended with exit code 0 [2025-03-09 06:53:51,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:51,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:51,829 INFO L229 MonitoredProcess]: Starting monitored process 304 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:51,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (304)] Waiting until timeout for monitored process [2025-03-09 06:53:51,831 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:51,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:51,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:51,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:51,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:51,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:51,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:51,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:51,842 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:51,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (304)] Ended with exit code 0 [2025-03-09 06:53:51,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:51,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:51,849 INFO L229 MonitoredProcess]: Starting monitored process 305 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:51,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (305)] Waiting until timeout for monitored process [2025-03-09 06:53:51,850 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:51,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:51,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:51,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:51,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:51,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:51,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:51,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:51,861 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:51,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (305)] Ended with exit code 0 [2025-03-09 06:53:51,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:51,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:51,868 INFO L229 MonitoredProcess]: Starting monitored process 306 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:51,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (306)] Waiting until timeout for monitored process [2025-03-09 06:53:51,870 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:51,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:51,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:51,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:51,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:51,881 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:51,881 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:51,883 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:51,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (306)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:51,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:51,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:51,890 INFO L229 MonitoredProcess]: Starting monitored process 307 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:51,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (307)] Waiting until timeout for monitored process [2025-03-09 06:53:51,892 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:51,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:51,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:51,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:51,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:51,904 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:51,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:51,911 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:51,919 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-09 06:53:51,919 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-09 06:53:51,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:51,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:51,921 INFO L229 MonitoredProcess]: Starting monitored process 308 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:51,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (308)] Waiting until timeout for monitored process [2025-03-09 06:53:51,922 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:51,934 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:53:51,934 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:51,934 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem16#1, v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_24, ULTIMATE.start_main_#t~mem15#1) = 1*ULTIMATE.start_main_#t~mem16#1 + 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_24 - 1*ULTIMATE.start_main_#t~mem15#1 Supporting invariants [] [2025-03-09 06:53:51,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (307)] Ended with exit code 0 [2025-03-09 06:53:51,955 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-03-09 06:53:51,956 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem15 [2025-03-09 06:53:51,956 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 06:53:51,956 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 06:53:51,956 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:51,956 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem16 [2025-03-09 06:53:51,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:51,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:51,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:51,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:51,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:51,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:53:51,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:52,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 06:53:52,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:53:52,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:52,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:52,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 06:53:52,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:52,039 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 38 treesize of output 15 [2025-03-09 06:53:52,051 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 27 treesize of output 19 [2025-03-09 06:53:52,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:52,079 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 31 treesize of output 23 [2025-03-09 06:53:52,080 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 38 treesize of output 15 [2025-03-09 06:53:52,108 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 31 treesize of output 23 [2025-03-09 06:53:52,111 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 38 treesize of output 15 [2025-03-09 06:53:52,127 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 23 treesize of output 15 [2025-03-09 06:53:52,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:52,148 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 27 treesize of output 19 [2025-03-09 06:53:52,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:52,205 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 37 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:52,205 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2025-03-09 06:53:52,205 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25546 states and 34016 transitions. cyclomatic complexity: 8913 Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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:52,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (308)] Ended with exit code 0 [2025-03-09 06:53:52,883 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25546 states and 34016 transitions. cyclomatic complexity: 8913. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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 71648 states and 93287 transitions. Complement of second has 43 states. [2025-03-09 06:53:52,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 1 stem states 20 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:52,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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:52,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 75 transitions. [2025-03-09 06:53:52,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 75 transitions. Stem has 18 letters. Loop has 36 letters. [2025-03-09 06:53:52,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:52,883 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:52,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:52,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:52,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:52,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:52,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:52,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:53:52,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:52,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 06:53:52,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:53:52,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:52,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:52,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 06:53:52,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:52,956 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 38 treesize of output 15 [2025-03-09 06:53:52,967 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 27 treesize of output 19 [2025-03-09 06:53:52,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:52,994 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 31 treesize of output 23 [2025-03-09 06:53:52,995 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 38 treesize of output 15 [2025-03-09 06:53:53,021 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 31 treesize of output 23 [2025-03-09 06:53:53,023 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 38 treesize of output 15 [2025-03-09 06:53:53,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:53,036 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 23 treesize of output 15 [2025-03-09 06:53:53,049 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 27 treesize of output 19 [2025-03-09 06:53:53,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:53,093 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 37 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:53,093 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 11 loop predicates [2025-03-09 06:53:53,093 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25546 states and 34016 transitions. cyclomatic complexity: 8913 Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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:53,577 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25546 states and 34016 transitions. cyclomatic complexity: 8913. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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 71648 states and 93287 transitions. Complement of second has 43 states. [2025-03-09 06:53:53,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 1 stem states 20 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:53,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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:53,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 75 transitions. [2025-03-09 06:53:53,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 75 transitions. Stem has 18 letters. Loop has 36 letters. [2025-03-09 06:53:53,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:53,578 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:53,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:53,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:53,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:53,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:53,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:53,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:53:53,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:53,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 06:53:53,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:53:53,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:53,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:53,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 06:53:53,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:53,646 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 38 treesize of output 15 [2025-03-09 06:53:53,656 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 27 treesize of output 19 [2025-03-09 06:53:53,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:53,680 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 31 treesize of output 23 [2025-03-09 06:53:53,681 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 38 treesize of output 15 [2025-03-09 06:53:53,705 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 31 treesize of output 23 [2025-03-09 06:53:53,706 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 38 treesize of output 15 [2025-03-09 06:53:53,719 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 23 treesize of output 15 [2025-03-09 06:53:53,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:53,733 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 27 treesize of output 19 [2025-03-09 06:53:53,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:53:53,773 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 37 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:53,774 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 11 loop predicates [2025-03-09 06:53:53,774 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25546 states and 34016 transitions. cyclomatic complexity: 8913 Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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:54,316 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25546 states and 34016 transitions. cyclomatic complexity: 8913. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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 80194 states and 106748 transitions. Complement of second has 118 states. [2025-03-09 06:53:54,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 1 stem states 20 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:54,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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:54,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 79 transitions. [2025-03-09 06:53:54,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 79 transitions. Stem has 18 letters. Loop has 36 letters. [2025-03-09 06:53:54,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:54,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 79 transitions. Stem has 54 letters. Loop has 36 letters. [2025-03-09 06:53:54,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:54,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 79 transitions. Stem has 18 letters. Loop has 72 letters. [2025-03-09 06:53:54,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:54,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80194 states and 106748 transitions. [2025-03-09 06:53:54,585 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 30985 [2025-03-09 06:53:54,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80194 states to 50424 states and 66659 transitions. [2025-03-09 06:53:54,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1376 [2025-03-09 06:53:54,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1439 [2025-03-09 06:53:54,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50424 states and 66659 transitions. [2025-03-09 06:53:54,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:54,688 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50424 states and 66659 transitions. [2025-03-09 06:53:54,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50424 states and 66659 transitions. [2025-03-09 06:53:54,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50424 to 38953. [2025-03-09 06:53:55,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38953 states, 38953 states have (on average 1.3401791903062665) internal successors, (52204), 38952 states have internal predecessors, (52204), 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:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38953 states to 38953 states and 52204 transitions. [2025-03-09 06:53:55,057 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38953 states and 52204 transitions. [2025-03-09 06:53:55,057 INFO L432 stractBuchiCegarLoop]: Abstraction has 38953 states and 52204 transitions. [2025-03-09 06:53:55,057 INFO L338 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2025-03-09 06:53:55,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38953 states and 52204 transitions. [2025-03-09 06:53:55,129 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 23281 [2025-03-09 06:53:55,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:55,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:55,131 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:55,131 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 6, 3, 3, 3, 3, 3, 2, 1] [2025-03-09 06:53:55,131 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:55,131 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:53:55,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:55,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1574637383, now seen corresponding path program 13 times [2025-03-09 06:53:55,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:55,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877466492] [2025-03-09 06:53:55,132 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:53:55,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:55,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:55,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:55,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:55,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:55,220 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:55,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:53:55,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:53:55,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:55,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:55,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:55,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:55,230 INFO L85 PathProgramCache]: Analyzing trace with hash -920482167, now seen corresponding path program 6 times [2025-03-09 06:53:55,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:55,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310393411] [2025-03-09 06:53:55,230 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:53:55,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:55,241 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 4 equivalence classes. [2025-03-09 06:53:55,246 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:53:55,246 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-09 06:53:55,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:55,246 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:55,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 06:53:55,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:53:55,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:55,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:55,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:55,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:55,258 INFO L85 PathProgramCache]: Analyzing trace with hash -892996913, now seen corresponding path program 10 times [2025-03-09 06:53:55,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:55,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292693433] [2025-03-09 06:53:55,258 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:53:55,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:55,270 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-03-09 06:53:55,279 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 06:53:55,279 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:53:55,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:55,279 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:55,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 06:53:55,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 06:53:55,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:55,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:55,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:59,660 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:59,660 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:59,660 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:59,660 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:59,660 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:59,660 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:59,660 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:59,660 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:59,660 INFO L132 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca-2.i_Iteration26_Lasso [2025-03-09 06:53:59,660 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:59,660 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:59,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,978 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:59,978 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:59,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:59,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:59,980 INFO L229 MonitoredProcess]: Starting monitored process 309 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:59,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (309)] Waiting until timeout for monitored process [2025-03-09 06:53:59,981 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:59,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:59,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:59,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:59,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:59,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:59,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:59,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:59,993 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:59,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (309)] Ended with exit code 0 [2025-03-09 06:53:59,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:59,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,000 INFO L229 MonitoredProcess]: Starting monitored process 310 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:54:00,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (310)] Waiting until timeout for monitored process [2025-03-09 06:54:00,002 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:54:00,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:00,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:00,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:00,019 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (310)] Ended with exit code 0 [2025-03-09 06:54:00,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,026 INFO L229 MonitoredProcess]: Starting monitored process 311 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:54:00,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (311)] Waiting until timeout for monitored process [2025-03-09 06:54:00,028 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:54:00,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:00,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,038 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:00,038 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:00,039 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (311)] Ended with exit code 0 [2025-03-09 06:54:00,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,045 INFO L229 MonitoredProcess]: Starting monitored process 312 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:54:00,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (312)] Waiting until timeout for monitored process [2025-03-09 06:54:00,047 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:54:00,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,058 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:00,058 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:00,060 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (312)] Ended with exit code 0 [2025-03-09 06:54:00,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,067 INFO L229 MonitoredProcess]: Starting monitored process 313 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:54:00,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (313)] Waiting until timeout for monitored process [2025-03-09 06:54:00,069 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:54:00,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:00,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:00,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:00,079 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (313)] Ended with exit code 0 [2025-03-09 06:54:00,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,086 INFO L229 MonitoredProcess]: Starting monitored process 314 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:54:00,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (314)] Waiting until timeout for monitored process [2025-03-09 06:54:00,088 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:54:00,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:00,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:00,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:00,099 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (314)] Ended with exit code 0 [2025-03-09 06:54:00,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,105 INFO L229 MonitoredProcess]: Starting monitored process 315 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:54:00,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (315)] Waiting until timeout for monitored process [2025-03-09 06:54:00,107 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:54:00,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:00,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,117 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:00,117 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:00,118 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (315)] Ended with exit code 0 [2025-03-09 06:54:00,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,124 INFO L229 MonitoredProcess]: Starting monitored process 316 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:54:00,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (316)] Waiting until timeout for monitored process [2025-03-09 06:54:00,126 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:54:00,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:00,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:00,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:00,136 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (316)] Ended with exit code 0 [2025-03-09 06:54:00,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,143 INFO L229 MonitoredProcess]: Starting monitored process 317 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:54:00,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (317)] Waiting until timeout for monitored process [2025-03-09 06:54:00,145 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:54:00,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:00,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:00,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:00,157 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (317)] Ended with exit code 0 [2025-03-09 06:54:00,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,164 INFO L229 MonitoredProcess]: Starting monitored process 318 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:54:00,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (318)] Waiting until timeout for monitored process [2025-03-09 06:54:00,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:54:00,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:00,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:00,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:00,179 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (318)] Ended with exit code 0 [2025-03-09 06:54:00,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,186 INFO L229 MonitoredProcess]: Starting monitored process 319 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:54:00,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (319)] Waiting until timeout for monitored process [2025-03-09 06:54:00,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:54:00,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:00,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:00,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:00,198 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (319)] Ended with exit code 0 [2025-03-09 06:54:00,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,205 INFO L229 MonitoredProcess]: Starting monitored process 320 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:54:00,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (320)] Waiting until timeout for monitored process [2025-03-09 06:54:00,206 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:54:00,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:00,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:00,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:00,217 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (320)] Ended with exit code 0 [2025-03-09 06:54:00,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,224 INFO L229 MonitoredProcess]: Starting monitored process 321 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:54:00,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (321)] Waiting until timeout for monitored process [2025-03-09 06:54:00,226 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:54:00,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:00,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:00,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:00,237 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (321)] Ended with exit code 0 [2025-03-09 06:54:00,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,244 INFO L229 MonitoredProcess]: Starting monitored process 322 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:54:00,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (322)] Waiting until timeout for monitored process [2025-03-09 06:54:00,246 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:54:00,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,255 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:00,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,256 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:00,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:00,256 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (322)] Ended with exit code 0 [2025-03-09 06:54:00,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,263 INFO L229 MonitoredProcess]: Starting monitored process 323 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:54:00,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (323)] Waiting until timeout for monitored process [2025-03-09 06:54:00,266 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:54:00,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:00,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:00,278 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (323)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:00,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,285 INFO L229 MonitoredProcess]: Starting monitored process 324 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:54:00,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (324)] Waiting until timeout for monitored process [2025-03-09 06:54:00,287 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:54:00,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:00,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:00,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:00,297 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (324)] Ended with exit code 0 [2025-03-09 06:54:00,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,304 INFO L229 MonitoredProcess]: Starting monitored process 325 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:54:00,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (325)] Waiting until timeout for monitored process [2025-03-09 06:54:00,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:54:00,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:00,316 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:00,318 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (325)] Ended with exit code 0 [2025-03-09 06:54:00,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,325 INFO L229 MonitoredProcess]: Starting monitored process 326 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:54:00,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (326)] Waiting until timeout for monitored process [2025-03-09 06:54:00,326 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:54:00,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:00,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:00,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:00,337 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (326)] Ended with exit code 0 [2025-03-09 06:54:00,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,344 INFO L229 MonitoredProcess]: Starting monitored process 327 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:54:00,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (327)] Waiting until timeout for monitored process [2025-03-09 06:54:00,346 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:54:00,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:00,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:00,360 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (327)] Ended with exit code 0 [2025-03-09 06:54:00,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,367 INFO L229 MonitoredProcess]: Starting monitored process 328 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:54:00,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (328)] Waiting until timeout for monitored process [2025-03-09 06:54:00,369 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:54:00,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,379 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:00,379 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:00,381 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (328)] Ended with exit code 0 [2025-03-09 06:54:00,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,389 INFO L229 MonitoredProcess]: Starting monitored process 329 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:54:00,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (329)] Waiting until timeout for monitored process [2025-03-09 06:54:00,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:54:00,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:00,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:00,455 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (329)] Ended with exit code 0 [2025-03-09 06:54:00,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,462 INFO L229 MonitoredProcess]: Starting monitored process 330 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:54:00,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (330)] Waiting until timeout for monitored process [2025-03-09 06:54:00,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:54:00,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,480 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:00,480 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:00,484 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (330)] Ended with exit code 0 [2025-03-09 06:54:00,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,491 INFO L229 MonitoredProcess]: Starting monitored process 331 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:54:00,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (331)] Waiting until timeout for monitored process [2025-03-09 06:54:00,493 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:54:00,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,506 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:00,506 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:00,514 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:54:00,521 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-09 06:54:00,521 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-03-09 06:54:00,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,523 INFO L229 MonitoredProcess]: Starting monitored process 332 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:54:00,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (332)] Waiting until timeout for monitored process [2025-03-09 06:54:00,524 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:54:00,534 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:54:00,534 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:54:00,534 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem16#1, v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) 0)_10, ULTIMATE.start_main_#t~mem15#1) = 1*ULTIMATE.start_main_#t~mem16#1 + 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) 0)_10 - 1*ULTIMATE.start_main_#t~mem15#1 Supporting invariants [] [2025-03-09 06:54:00,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (331)] Ended with exit code 0 [2025-03-09 06:54:00,557 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2025-03-09 06:54:00,558 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 06:54:00,558 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 06:54:00,558 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:54:00,559 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem15 [2025-03-09 06:54:00,559 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem16 [2025-03-09 06:54:00,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:00,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:54:00,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:54:00,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:00,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:00,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:54:00,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:00,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 06:54:00,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:54:00,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:00,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:00,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-09 06:54:00,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:00,667 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 38 treesize of output 15 [2025-03-09 06:54:00,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-09 06:54:00,691 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 23 treesize of output 15 [2025-03-09 06:54:00,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:54:00,717 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 23 treesize of output 15 [2025-03-09 06:54:00,761 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 25 treesize of output 17 [2025-03-09 06:54:00,764 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 38 treesize of output 15 [2025-03-09 06:54:00,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-09 06:54:00,792 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 23 treesize of output 15 [2025-03-09 06:54:00,841 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 40 treesize of output 28 [2025-03-09 06:54:00,845 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 23 treesize of output 15 [2025-03-09 06:54:00,907 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 31 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:00,908 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 11 loop predicates [2025-03-09 06:54:00,908 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38953 states and 52204 transitions. cyclomatic complexity: 13884 Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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:54:01,734 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38953 states and 52204 transitions. cyclomatic complexity: 13884. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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 113763 states and 148975 transitions. Complement of second has 44 states. [2025-03-09 06:54:01,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 2 stem states 20 non-accepting loop states 1 accepting loop states [2025-03-09 06:54:01,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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:54:01,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions. [2025-03-09 06:54:01,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 75 transitions. Stem has 18 letters. Loop has 36 letters. [2025-03-09 06:54:01,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:01,735 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:54:01,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:01,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:54:01,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:54:01,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:01,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:01,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:54:01,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:01,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 06:54:01,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:54:01,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:01,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:01,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-09 06:54:01,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:01,845 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 38 treesize of output 15 [2025-03-09 06:54:01,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-09 06:54:01,869 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 23 treesize of output 15 [2025-03-09 06:54:01,893 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 23 treesize of output 15 [2025-03-09 06:54:01,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:54:01,941 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 25 treesize of output 17 [2025-03-09 06:54:01,943 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 38 treesize of output 15 [2025-03-09 06:54:01,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-09 06:54:01,970 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 23 treesize of output 15 [2025-03-09 06:54:02,025 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 40 treesize of output 28 [2025-03-09 06:54:02,027 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 23 treesize of output 15 [2025-03-09 06:54:02,093 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 31 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:02,093 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 11 loop predicates [2025-03-09 06:54:02,093 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38953 states and 52204 transitions. cyclomatic complexity: 13884 Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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:54:02,867 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38953 states and 52204 transitions. cyclomatic complexity: 13884. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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 113763 states and 148975 transitions. Complement of second has 44 states. [2025-03-09 06:54:02,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 2 stem states 20 non-accepting loop states 1 accepting loop states [2025-03-09 06:54:02,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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:54:02,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions. [2025-03-09 06:54:02,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 75 transitions. Stem has 18 letters. Loop has 36 letters. [2025-03-09 06:54:02,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:02,868 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:54:02,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:02,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:54:02,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:54:02,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:02,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:02,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:54:02,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:02,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 06:54:02,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:54:02,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:02,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:02,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-09 06:54:02,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:02,965 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 38 treesize of output 15 [2025-03-09 06:54:02,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-09 06:54:02,986 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 23 treesize of output 15 [2025-03-09 06:54:03,008 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 23 treesize of output 15 [2025-03-09 06:54:03,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:54:03,049 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 25 treesize of output 17 [2025-03-09 06:54:03,051 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 38 treesize of output 15 [2025-03-09 06:54:03,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-09 06:54:03,082 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 23 treesize of output 15 [2025-03-09 06:54:03,122 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 40 treesize of output 28 [2025-03-09 06:54:03,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 23 treesize of output 15 [2025-03-09 06:54:03,178 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 31 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:03,178 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 11 loop predicates [2025-03-09 06:54:03,178 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38953 states and 52204 transitions. cyclomatic complexity: 13884 Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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:54:03,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (332)] Ended with exit code 0 [2025-03-09 06:54:03,993 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38953 states and 52204 transitions. cyclomatic complexity: 13884. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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 158439 states and 209162 transitions. Complement of second has 80 states. [2025-03-09 06:54:03,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 2 stem states 20 non-accepting loop states 1 accepting loop states [2025-03-09 06:54:03,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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:54:03,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 79 transitions. [2025-03-09 06:54:03,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 79 transitions. Stem has 18 letters. Loop has 36 letters. [2025-03-09 06:54:03,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:03,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 79 transitions. Stem has 54 letters. Loop has 36 letters. [2025-03-09 06:54:03,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:03,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 79 transitions. Stem has 18 letters. Loop has 72 letters. [2025-03-09 06:54:03,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:03,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158439 states and 209162 transitions. [2025-03-09 06:54:04,530 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 86045 [2025-03-09 06:54:04,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158439 states to 120120 states and 157278 transitions. [2025-03-09 06:54:04,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2175 [2025-03-09 06:54:04,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2413 [2025-03-09 06:54:04,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120120 states and 157278 transitions. [2025-03-09 06:54:04,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:54:04,828 INFO L218 hiAutomatonCegarLoop]: Abstraction has 120120 states and 157278 transitions. [2025-03-09 06:54:04,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120120 states and 157278 transitions. [2025-03-09 06:54:05,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120120 to 81201. [2025-03-09 06:54:05,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81201 states, 81201 states have (on average 1.35825913473972) internal successors, (110292), 81200 states have internal predecessors, (110292), 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:54:06,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81201 states to 81201 states and 110292 transitions. [2025-03-09 06:54:06,037 INFO L240 hiAutomatonCegarLoop]: Abstraction has 81201 states and 110292 transitions. [2025-03-09 06:54:06,037 INFO L432 stractBuchiCegarLoop]: Abstraction has 81201 states and 110292 transitions. [2025-03-09 06:54:06,037 INFO L338 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2025-03-09 06:54:06,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81201 states and 110292 transitions. [2025-03-09 06:54:06,215 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 59344 [2025-03-09 06:54:06,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:06,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:06,217 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:06,217 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 6, 3, 3, 3, 3, 3, 2, 1] [2025-03-09 06:54:06,217 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:54:06,217 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:54:06,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:06,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1574637383, now seen corresponding path program 14 times [2025-03-09 06:54:06,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:06,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775353135] [2025-03-09 06:54:06,219 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:54:06,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:06,228 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 06:54:06,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:54:06,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:54:06,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:06,232 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:06,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:54:06,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:54:06,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:06,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:06,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:06,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:06,240 INFO L85 PathProgramCache]: Analyzing trace with hash -2084442487, now seen corresponding path program 7 times [2025-03-09 06:54:06,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:06,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792088069] [2025-03-09 06:54:06,240 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:54:06,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:06,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 06:54:06,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:54:06,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:06,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:06,255 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:06,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 06:54:06,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:54:06,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:06,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:06,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:06,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:06,266 INFO L85 PathProgramCache]: Analyzing trace with hash -2056957233, now seen corresponding path program 11 times [2025-03-09 06:54:06,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:06,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754644478] [2025-03-09 06:54:06,266 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:54:06,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:06,278 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 8 equivalence classes. [2025-03-09 06:54:06,295 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 06:54:06,295 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-09 06:54:06,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:06,295 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:06,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 06:54:06,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 06:54:06,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:06,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:06,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:10,751 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:54:10,751 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:54:10,751 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:54:10,751 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:54:10,751 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:54:10,751 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:10,751 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:54:10,751 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:54:10,751 INFO L132 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca-2.i_Iteration27_Lasso [2025-03-09 06:54:10,751 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:54:10,751 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:54:10,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:10,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:10,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:10,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:10,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:10,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:10,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:10,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:10,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:10,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:10,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:10,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:10,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:10,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:10,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:10,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:10,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:10,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:10,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:11,082 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:54:11,082 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:54:11,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:11,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:11,084 INFO L229 MonitoredProcess]: Starting monitored process 333 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:54:11,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (333)] Waiting until timeout for monitored process [2025-03-09 06:54:11,086 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:54:11,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:11,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:11,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:11,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:11,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:11,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:11,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:11,098 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:11,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (333)] Ended with exit code 0 [2025-03-09 06:54:11,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:11,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:11,105 INFO L229 MonitoredProcess]: Starting monitored process 334 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:54:11,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (334)] Waiting until timeout for monitored process [2025-03-09 06:54:11,106 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:54:11,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:11,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:11,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:11,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:11,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:11,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:11,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:11,117 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:11,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (334)] Ended with exit code 0 [2025-03-09 06:54:11,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:11,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:11,124 INFO L229 MonitoredProcess]: Starting monitored process 335 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:54:11,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (335)] Waiting until timeout for monitored process [2025-03-09 06:54:11,126 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:54:11,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:11,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:11,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:11,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:11,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:11,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:11,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:11,136 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:11,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (335)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:11,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:11,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:11,182 INFO L229 MonitoredProcess]: Starting monitored process 336 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:54:11,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (336)] Waiting until timeout for monitored process [2025-03-09 06:54:11,184 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:54:11,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:11,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:11,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:11,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:11,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:11,194 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:11,194 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:11,195 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:11,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (336)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:11,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:11,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:11,202 INFO L229 MonitoredProcess]: Starting monitored process 337 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:54:11,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (337)] Waiting until timeout for monitored process [2025-03-09 06:54:11,203 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:54:11,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:11,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:11,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:11,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:11,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:11,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:11,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:11,214 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:11,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (337)] Ended with exit code 0 [2025-03-09 06:54:11,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:11,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:11,221 INFO L229 MonitoredProcess]: Starting monitored process 338 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:54:11,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (338)] Waiting until timeout for monitored process [2025-03-09 06:54:11,222 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:54:11,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:11,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:11,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:11,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:11,233 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:11,233 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:11,237 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:11,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (338)] Ended with exit code 0 [2025-03-09 06:54:11,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:11,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:11,243 INFO L229 MonitoredProcess]: Starting monitored process 339 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:54:11,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (339)] Waiting until timeout for monitored process [2025-03-09 06:54:11,245 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:54:11,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:11,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:11,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:11,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:11,256 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:11,256 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:11,260 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:11,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (339)] Ended with exit code 0 [2025-03-09 06:54:11,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:11,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:11,267 INFO L229 MonitoredProcess]: Starting monitored process 340 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:54:11,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (340)] Waiting until timeout for monitored process [2025-03-09 06:54:11,269 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:54:11,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:11,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:11,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:11,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:11,279 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:11,279 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:11,283 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:11,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (340)] Ended with exit code 0 [2025-03-09 06:54:11,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:11,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:11,290 INFO L229 MonitoredProcess]: Starting monitored process 341 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:54:11,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (341)] Waiting until timeout for monitored process [2025-03-09 06:54:11,292 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:54:11,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:11,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:11,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:11,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:11,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:11,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:11,308 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:11,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (341)] Ended with exit code 0 [2025-03-09 06:54:11,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:11,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:11,315 INFO L229 MonitoredProcess]: Starting monitored process 342 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:54:11,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (342)] Waiting until timeout for monitored process [2025-03-09 06:54:11,317 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:54:11,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:11,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:11,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:11,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:11,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:11,328 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:11,331 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:11,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (342)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:11,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:11,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:11,338 INFO L229 MonitoredProcess]: Starting monitored process 343 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:54:11,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (343)] Waiting until timeout for monitored process [2025-03-09 06:54:11,340 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:54:11,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:11,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:11,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:11,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:11,353 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:11,353 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:11,360 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:54:11,366 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-09 06:54:11,366 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-03-09 06:54:11,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:11,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:11,368 INFO L229 MonitoredProcess]: Starting monitored process 344 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:54:11,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (344)] Waiting until timeout for monitored process [2025-03-09 06:54:11,369 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:54:11,379 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:54:11,380 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:54:11,380 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)_26, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~mem15#1) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_26 + 1*ULTIMATE.start_main_#t~mem16#1 - 1*ULTIMATE.start_main_#t~mem15#1 Supporting invariants [] [2025-03-09 06:54:11,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (343)] Ended with exit code 0 [2025-03-09 06:54:11,401 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2025-03-09 06:54:11,402 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem15 [2025-03-09 06:54:11,402 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 06:54:11,402 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 06:54:11,402 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:54:11,402 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem16 [2025-03-09 06:54:11,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:11,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:54:11,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:54:11,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:11,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:11,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:54:11,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:11,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 06:54:11,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:54:11,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:11,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:11,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-09 06:54:11,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:11,483 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 38 treesize of output 15 [2025-03-09 06:54:11,506 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 25 treesize of output 17 [2025-03-09 06:54:11,507 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 38 treesize of output 15 [2025-03-09 06:54:11,519 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 27 treesize of output 19 [2025-03-09 06:54:11,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:54:11,546 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 31 treesize of output 23 [2025-03-09 06:54:11,547 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 38 treesize of output 15 [2025-03-09 06:54:11,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:54:11,562 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 23 treesize of output 15 [2025-03-09 06:54:11,579 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 27 treesize of output 19 [2025-03-09 06:54:11,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:54:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 31 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:11,627 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2025-03-09 06:54:11,627 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81201 states and 110292 transitions. cyclomatic complexity: 30020 Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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:54:12,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (344)] Ended with exit code 0 [2025-03-09 06:54:12,659 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81201 states and 110292 transitions. cyclomatic complexity: 30020. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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 210710 states and 277794 transitions. Complement of second has 47 states. [2025-03-09 06:54:12,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 24 states 1 stem states 22 non-accepting loop states 1 accepting loop states [2025-03-09 06:54:12,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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:54:12,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 76 transitions. [2025-03-09 06:54:12,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 76 transitions. Stem has 18 letters. Loop has 36 letters. [2025-03-09 06:54:12,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:12,660 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:54:12,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:12,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:54:12,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:54:12,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:12,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:12,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:54:12,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:12,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 06:54:12,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:54:12,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:12,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:12,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-09 06:54:12,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:12,737 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 38 treesize of output 15 [2025-03-09 06:54:12,761 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 25 treesize of output 17 [2025-03-09 06:54:12,762 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 38 treesize of output 15 [2025-03-09 06:54:12,775 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 27 treesize of output 19 [2025-03-09 06:54:12,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:54:12,800 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 31 treesize of output 23 [2025-03-09 06:54:12,801 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 38 treesize of output 15 [2025-03-09 06:54:12,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:54:12,819 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 23 treesize of output 15 [2025-03-09 06:54:12,834 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 27 treesize of output 19 [2025-03-09 06:54:12,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:54:12,878 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 31 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:12,878 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 11 loop predicates [2025-03-09 06:54:12,879 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81201 states and 110292 transitions. cyclomatic complexity: 30020 Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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:54:13,752 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81201 states and 110292 transitions. cyclomatic complexity: 30020. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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 210710 states and 277794 transitions. Complement of second has 47 states. [2025-03-09 06:54:13,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 24 states 1 stem states 22 non-accepting loop states 1 accepting loop states [2025-03-09 06:54:13,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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:54:13,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 76 transitions. [2025-03-09 06:54:13,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 76 transitions. Stem has 18 letters. Loop has 36 letters. [2025-03-09 06:54:13,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:13,753 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:54:13,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:13,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:54:13,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:54:13,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:13,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:13,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:54:13,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:13,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 06:54:13,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:54:13,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:13,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:13,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-09 06:54:13,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:13,825 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 38 treesize of output 15 [2025-03-09 06:54:13,848 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 25 treesize of output 17 [2025-03-09 06:54:13,849 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 38 treesize of output 15 [2025-03-09 06:54:13,860 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 27 treesize of output 19 [2025-03-09 06:54:13,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:54:13,885 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 31 treesize of output 23 [2025-03-09 06:54:13,886 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 38 treesize of output 15 [2025-03-09 06:54:13,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:54:13,902 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 23 treesize of output 15 [2025-03-09 06:54:13,915 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 27 treesize of output 19 [2025-03-09 06:54:13,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:54:13,954 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 31 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:13,955 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 11 loop predicates [2025-03-09 06:54:13,955 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81201 states and 110292 transitions. cyclomatic complexity: 30020 Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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:54:15,098 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81201 states and 110292 transitions. cyclomatic complexity: 30020. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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 330068 states and 428379 transitions. Complement of second has 125 states. [2025-03-09 06:54:15,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 24 states 1 stem states 22 non-accepting loop states 1 accepting loop states [2025-03-09 06:54:15,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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:54:15,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 80 transitions. [2025-03-09 06:54:15,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 80 transitions. Stem has 18 letters. Loop has 36 letters. [2025-03-09 06:54:15,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:15,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 80 transitions. Stem has 54 letters. Loop has 36 letters. [2025-03-09 06:54:15,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:15,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 80 transitions. Stem has 18 letters. Loop has 72 letters. [2025-03-09 06:54:15,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:15,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 330068 states and 428379 transitions. [2025-03-09 06:54:16,500 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 141700 [2025-03-09 06:54:16,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 330068 states to 196426 states and 255744 transitions. [2025-03-09 06:54:16,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2665 [2025-03-09 06:54:16,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2844 [2025-03-09 06:54:16,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196426 states and 255744 transitions. [2025-03-09 06:54:16,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:54:16,938 INFO L218 hiAutomatonCegarLoop]: Abstraction has 196426 states and 255744 transitions. [2025-03-09 06:54:17,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196426 states and 255744 transitions. [2025-03-09 06:54:18,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196426 to 136963. [2025-03-09 06:54:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136963 states, 136963 states have (on average 1.3763644195877718) internal successors, (188511), 136962 states have internal predecessors, (188511), 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:54:18,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136963 states to 136963 states and 188511 transitions. [2025-03-09 06:54:18,631 INFO L240 hiAutomatonCegarLoop]: Abstraction has 136963 states and 188511 transitions. [2025-03-09 06:54:18,631 INFO L432 stractBuchiCegarLoop]: Abstraction has 136963 states and 188511 transitions. [2025-03-09 06:54:18,631 INFO L338 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2025-03-09 06:54:18,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136963 states and 188511 transitions. [2025-03-09 06:54:19,150 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 104124 [2025-03-09 06:54:19,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:19,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:19,152 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:19,152 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 6, 3, 3, 3, 3, 3, 2, 1] [2025-03-09 06:54:19,152 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~nondet9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:54:19,152 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#1(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem18#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem18#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem18#1;" "havoc main_#t~nondet19#1;call write~int#0(main_#t~nondet19#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet19#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call main_#t~mem10#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 < main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem12#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem12#1;" "havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet14#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 := main_#t~mem6#1 > 0;" "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;havoc main_#t~nondet9#1;" "assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;call main_#t~mem15#1 := read~int#1(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem16#1 := read~int#0(main_~y~0#1.base, main_~y~0#1.offset, 4);" [2025-03-09 06:54:19,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:19,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1574637383, now seen corresponding path program 15 times [2025-03-09 06:54:19,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:19,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472490371] [2025-03-09 06:54:19,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:54:19,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:19,160 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-03-09 06:54:19,163 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:54:19,164 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 06:54:19,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:19,164 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:19,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:54:19,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:54:19,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:19,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:19,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:19,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:19,171 INFO L85 PathProgramCache]: Analyzing trace with hash -676705527, now seen corresponding path program 8 times [2025-03-09 06:54:19,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:19,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419914366] [2025-03-09 06:54:19,171 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:54:19,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:19,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-09 06:54:19,196 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:54:19,196 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:54:19,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:19,196 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:19,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 06:54:19,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:54:19,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:19,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:19,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:19,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:19,205 INFO L85 PathProgramCache]: Analyzing trace with hash -649220273, now seen corresponding path program 12 times [2025-03-09 06:54:19,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:19,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78814055] [2025-03-09 06:54:19,205 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:54:19,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:19,217 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 7 equivalence classes. [2025-03-09 06:54:19,232 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 06:54:19,232 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-09 06:54:19,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:19,232 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:19,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 06:54:19,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 06:54:19,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:19,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:19,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace