./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/diff-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 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/array-memsafety/diff-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 5cc33a4b6801f9f06dbbb17ff694aba4439c76c6a2b62ec290c2132cc01ea0fe --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:45:18,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:45:18,744 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 15:45:18,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:45:18,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:45:18,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:45:18,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:45:18,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:45:18,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:45:18,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:45:18,775 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:45:18,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:45:18,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:45:18,776 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:45:18,776 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:45:18,776 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:45:18,777 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:45:18,777 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:45:18,777 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:45:18,777 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:45:18,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:45:18,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:45:18,777 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:45:18,777 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:45:18,777 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:45:18,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:45:18,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:45:18,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:45:18,777 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:45:18,778 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:45:18,778 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:45:18,778 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:45:18,778 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:45:18,778 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:45:18,778 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:45:18,778 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:45:18,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:45:18,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:45:18,779 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:45:18,779 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:45:18,779 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5cc33a4b6801f9f06dbbb17ff694aba4439c76c6a2b62ec290c2132cc01ea0fe [2025-03-04 15:45:19,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:45:19,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:45:19,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:45:19,010 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:45:19,010 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:45:19,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/diff-alloca-2.i [2025-03-04 15:45:20,133 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41f9c0eae/7d83ee63ae084b42bb93aa6fa94f5e63/FLAG68cf696f6 [2025-03-04 15:45:20,430 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:45:20,430 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/diff-alloca-2.i [2025-03-04 15:45:20,440 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41f9c0eae/7d83ee63ae084b42bb93aa6fa94f5e63/FLAG68cf696f6 [2025-03-04 15:45:20,707 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41f9c0eae/7d83ee63ae084b42bb93aa6fa94f5e63 [2025-03-04 15:45:20,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:45:20,713 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:45:20,714 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:45:20,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:45:20,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:45:20,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:45:20" (1/1) ... [2025-03-04 15:45:20,719 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca5a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:20, skipping insertion in model container [2025-03-04 15:45:20,719 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:45:20" (1/1) ... [2025-03-04 15:45:20,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:45:20,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:45:20,964 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:45:20,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:45:21,009 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:45:21,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:21 WrapperNode [2025-03-04 15:45:21,010 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:45:21,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:45:21,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:45:21,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:45:21,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:21" (1/1) ... [2025-03-04 15:45:21,023 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:21" (1/1) ... [2025-03-04 15:45:21,035 INFO L138 Inliner]: procedures = 116, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 89 [2025-03-04 15:45:21,036 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:45:21,036 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:45:21,036 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:45:21,036 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:45:21,041 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:21" (1/1) ... [2025-03-04 15:45:21,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:21" (1/1) ... [2025-03-04 15:45:21,043 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:21" (1/1) ... [2025-03-04 15:45:21,055 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 1, 3]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 3 writes are split as follows [1, 1, 1]. [2025-03-04 15:45:21,056 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:21" (1/1) ... [2025-03-04 15:45:21,056 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:21" (1/1) ... [2025-03-04 15:45:21,059 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:21" (1/1) ... [2025-03-04 15:45:21,060 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:21" (1/1) ... [2025-03-04 15:45:21,061 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:21" (1/1) ... [2025-03-04 15:45:21,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:21" (1/1) ... [2025-03-04 15:45:21,062 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:45:21,063 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:45:21,063 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:45:21,063 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:45:21,064 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:21" (1/1) ... [2025-03-04 15:45:21,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:21,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:21,086 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-04 15:45:21,089 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-04 15:45:21,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:45:21,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:45:21,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:45:21,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:45:21,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:45:21,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:45:21,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:45:21,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:45:21,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:45:21,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:45:21,177 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:45:21,178 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:45:21,286 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L545: call ULTIMATE.dealloc(main_#t~malloc10#1.base, main_#t~malloc10#1.offset);havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call ULTIMATE.dealloc(main_#t~malloc11#1.base, main_#t~malloc11#1.offset);havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call ULTIMATE.dealloc(main_#t~malloc12#1.base, main_#t~malloc12#1.offset);havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset; [2025-03-04 15:45:21,294 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-04 15:45:21,294 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:45:21,304 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:45:21,304 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:45:21,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:45:21 BoogieIcfgContainer [2025-03-04 15:45:21,304 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:45:21,305 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:45:21,305 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:45:21,309 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:45:21,309 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:45:21,310 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:45:20" (1/3) ... [2025-03-04 15:45:21,311 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fe065cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:45:21, skipping insertion in model container [2025-03-04 15:45:21,311 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:45:21,312 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:21" (2/3) ... [2025-03-04 15:45:21,312 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fe065cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:45:21, skipping insertion in model container [2025-03-04 15:45:21,312 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:45:21,313 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:45:21" (3/3) ... [2025-03-04 15:45:21,314 INFO L363 chiAutomizerObserver]: Analyzing ICFG diff-alloca-2.i [2025-03-04 15:45:21,343 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:45:21,343 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:45:21,344 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:45:21,344 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:45:21,344 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:45:21,344 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:45:21,344 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:45:21,344 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:45:21,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 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-04 15:45:21,361 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-04 15:45:21,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:21,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:21,365 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:45:21,365 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:45:21,365 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:45:21,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 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-04 15:45:21,367 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-04 15:45:21,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:21,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:21,368 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:45:21,368 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:45:21,373 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~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~i~1#1, main_#t~nondet15#1, main_#t~post16#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;havoc main_#t~nondet8#1;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;" "assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911);" "assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1 % 4294967296);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1 % 4294967296);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1 % 4294967296);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0;" [2025-03-04 15:45:21,373 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~1#1 < main_~Alen~0#1;havoc main_#t~nondet13#1;call write~int#2(main_#t~nondet13#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-04 15:45:21,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:21,378 INFO L85 PathProgramCache]: Analyzing trace with hash 50546323, now seen corresponding path program 1 times [2025-03-04 15:45:21,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:21,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969791643] [2025-03-04 15:45:21,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:21,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:21,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:45:21,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:45:21,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:21,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:21,453 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:21,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:45:21,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:45:21,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:21,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:21,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:21,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:21,483 INFO L85 PathProgramCache]: Analyzing trace with hash 47, now seen corresponding path program 1 times [2025-03-04 15:45:21,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:21,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242325800] [2025-03-04 15:45:21,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:21,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:21,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:45:21,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:45:21,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:21,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:21,497 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:21,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:45:21,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:45:21,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:21,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:21,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:21,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:21,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1566936029, now seen corresponding path program 1 times [2025-03-04 15:45:21,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:21,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866803614] [2025-03-04 15:45:21,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:21,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:21,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:45:21,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:45:21,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:21,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:21,534 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:21,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:45:21,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:45:21,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:21,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:21,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:21,999 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:45:21,999 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:45:22,000 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:45:22,000 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:45:22,000 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:45:22,000 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:22,000 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:45:22,000 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:45:22,000 INFO L132 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration1_Lasso [2025-03-04 15:45:22,000 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:45:22,000 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:45:22,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,713 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:45:22,716 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:45:22,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:22,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:22,719 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-04 15:45:22,722 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-04 15:45:22,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:22,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:22,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:22,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:22,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:22,740 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:22,740 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:22,746 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:22,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:22,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:22,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:22,756 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-04 15:45:22,757 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-04 15:45:22,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:22,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:22,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:22,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:22,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:22,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:22,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:22,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:22,773 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:22,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:22,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:22,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:22,782 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-04 15:45:22,784 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-04 15:45:22,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:22,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:22,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:22,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:22,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:22,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:22,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:22,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:22,797 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:22,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:22,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:22,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:22,804 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-04 15:45:22,805 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-04 15:45:22,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:22,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:22,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:22,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:22,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:22,819 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:22,819 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:22,823 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:22,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-04 15:45:22,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:22,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:22,830 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-04 15:45:22,831 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-04 15:45:22,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:22,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:22,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:22,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:22,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:22,845 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:22,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:22,849 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:22,855 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-04 15:45:22,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:22,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:22,857 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-04 15:45:22,858 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-04 15:45:22,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:22,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:22,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:22,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:22,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:22,876 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:22,876 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:22,886 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:45:22,907 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-04 15:45:22,909 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-03-04 15:45:22,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:22,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:22,912 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-04 15:45:22,914 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-04 15:45:22,915 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:45:22,927 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:45:22,927 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:45:22,928 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~Alen~0#1) = -1*ULTIMATE.start_main_~i~1#1 + 1*ULTIMATE.start_main_~Alen~0#1 Supporting invariants [] [2025-03-04 15:45:22,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-04 15:45:22,961 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-03-04 15:45:22,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:22,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:45:23,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:45:23,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:23,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:23,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:45:23,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:23,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:45:23,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:45:23,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:23,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:23,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:45:23,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:23,028 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-04 15:45:23,046 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-04 15:45:23,047 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-04 15:45:23,068 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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) Result 18 states and 27 transitions. Complement of second has 3 states. [2025-03-04 15:45:23,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-04 15:45:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-04 15:45:23,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2025-03-04 15:45:23,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 5 letters. Loop has 1 letters. [2025-03-04 15:45:23,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:23,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 1 letters. [2025-03-04 15:45:23,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:23,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 5 letters. Loop has 2 letters. [2025-03-04 15:45:23,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:23,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 27 transitions. [2025-03-04 15:45:23,079 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-04 15:45:23,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 23 transitions. [2025-03-04 15:45:23,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-04 15:45:23,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-04 15:45:23,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 23 transitions. [2025-03-04 15:45:23,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:45:23,082 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2025-03-04 15:45:23,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 23 transitions. [2025-03-04 15:45:23,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-03-04 15:45:23,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 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-04 15:45:23,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2025-03-04 15:45:23,098 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 21 transitions. [2025-03-04 15:45:23,098 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 21 transitions. [2025-03-04 15:45:23,098 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:45:23,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 21 transitions. [2025-03-04 15:45:23,099 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-04 15:45:23,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:23,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:23,099 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:45:23,099 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:45:23,099 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~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~i~1#1, main_#t~nondet15#1, main_#t~post16#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;havoc main_#t~nondet8#1;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;" "assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911);" "assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1 % 4294967296);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1 % 4294967296);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1 % 4294967296);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0;" "assume !(main_~i~1#1 < main_~Alen~0#1);havoc main_~i~1#1;main_~i~2#1 := 0;" [2025-03-04 15:45:23,099 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~2#1 < main_~Blen~0#1;havoc main_#t~nondet15#1;call write~int#0(main_#t~nondet15#1, main_~B~0#1.base, main_~B~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~nondet15#1;main_#t~post16#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1;" [2025-03-04 15:45:23,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:23,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1566936028, now seen corresponding path program 1 times [2025-03-04 15:45:23,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:23,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430894488] [2025-03-04 15:45:23,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:23,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:23,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:45:23,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:45:23,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:23,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:23,191 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-04 15:45:23,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:45:23,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430894488] [2025-03-04 15:45:23,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430894488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:45:23,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:45:23,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:45:23,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305466666] [2025-03-04 15:45:23,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:45:23,194 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:45:23,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:23,194 INFO L85 PathProgramCache]: Analyzing trace with hash 45, now seen corresponding path program 1 times [2025-03-04 15:45:23,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:23,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197469631] [2025-03-04 15:45:23,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:23,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:23,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:45:23,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:45:23,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:23,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:23,204 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:23,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:45:23,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:45:23,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:23,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:23,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:23,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:45:23,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:45:23,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:45:23,248 INFO L87 Difference]: Start difference. First operand 13 states and 21 transitions. cyclomatic complexity: 11 Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:45:23,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:45:23,264 INFO L93 Difference]: Finished difference Result 13 states and 20 transitions. [2025-03-04 15:45:23,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 20 transitions. [2025-03-04 15:45:23,265 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-04 15:45:23,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 20 transitions. [2025-03-04 15:45:23,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-04 15:45:23,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-03-04 15:45:23,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 20 transitions. [2025-03-04 15:45:23,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:45:23,265 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 20 transitions. [2025-03-04 15:45:23,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 20 transitions. [2025-03-04 15:45:23,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-04 15:45:23,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 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-04 15:45:23,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2025-03-04 15:45:23,266 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 20 transitions. [2025-03-04 15:45:23,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:45:23,268 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2025-03-04 15:45:23,268 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:45:23,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 20 transitions. [2025-03-04 15:45:23,268 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-04 15:45:23,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:23,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:23,268 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:45:23,268 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:45:23,268 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~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~i~1#1, main_#t~nondet15#1, main_#t~post16#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;havoc main_#t~nondet8#1;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;" "assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911);" "assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1 % 4294967296);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1 % 4294967296);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1 % 4294967296);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~Alen~0#1;havoc main_#t~nondet13#1;call write~int#2(main_#t~nondet13#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~i~1#1 < main_~Alen~0#1);havoc main_~i~1#1;main_~i~2#1 := 0;" [2025-03-04 15:45:23,268 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~2#1 < main_~Blen~0#1;havoc main_#t~nondet15#1;call write~int#0(main_#t~nondet15#1, main_~B~0#1.base, main_~B~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~nondet15#1;main_#t~post16#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1;" [2025-03-04 15:45:23,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:23,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1330376658, now seen corresponding path program 1 times [2025-03-04 15:45:23,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:23,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86905966] [2025-03-04 15:45:23,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:23,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:23,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:45:23,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:45:23,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:23,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:23,285 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:23,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:45:23,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:45:23,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:23,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:23,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:23,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:23,302 INFO L85 PathProgramCache]: Analyzing trace with hash 45, now seen corresponding path program 2 times [2025-03-04 15:45:23,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:23,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931853163] [2025-03-04 15:45:23,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:45:23,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:23,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:45:23,308 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:45:23,308 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:45:23,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:23,308 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:23,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:45:23,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:45:23,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:23,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:23,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:23,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:23,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1707996548, now seen corresponding path program 1 times [2025-03-04 15:45:23,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:23,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021603727] [2025-03-04 15:45:23,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:23,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:23,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:45:23,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:45:23,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:23,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:23,339 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:23,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:45:23,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:45:23,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:23,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:23,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:23,430 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-04 15:45:23,762 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:45:23,763 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:45:23,763 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:45:23,763 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:45:23,763 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:45:23,763 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:23,763 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:45:23,763 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:45:23,763 INFO L132 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration3_Lasso [2025-03-04 15:45:23,763 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:45:23,763 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:45:23,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:23,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:23,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:23,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:23,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:23,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:23,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:23,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:23,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:23,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:23,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:23,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:23,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:23,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:23,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:23,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:23,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:23,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:24,201 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:45:24,201 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:45:24,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:24,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:24,203 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-04 15:45:24,204 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-04 15:45:24,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-04 15:45:24,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:24,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:24,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:24,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:24,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:24,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:24,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:24,216 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:24,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-04 15:45:24,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:24,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:24,223 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-04 15:45:24,224 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-04 15:45:24,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:24,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:24,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:24,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:24,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:24,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:24,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:24,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:24,236 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:24,241 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-04 15:45:24,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:24,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:24,243 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-04 15:45:24,243 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-04 15:45:24,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:24,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:24,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:24,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:24,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:24,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:24,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:24,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:24,256 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:24,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-04 15:45:24,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:24,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:24,263 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-04 15:45:24,264 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-04 15:45:24,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-04 15:45:24,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:24,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:24,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:24,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:24,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:24,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:24,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:24,283 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-04 15:45:24,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:24,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:24,285 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-04 15:45:24,286 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-04 15:45:24,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-04 15:45:24,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:24,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:24,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:24,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:24,298 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:24,298 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:24,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:24,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:24,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:24,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:24,307 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-04 15:45:24,308 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-04 15:45:24,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:24,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:24,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:24,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:24,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:24,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:24,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:24,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:24,321 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:24,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:24,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:24,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:24,328 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-04 15:45:24,329 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-04 15:45:24,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:24,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:24,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:24,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:24,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:24,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:24,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:24,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:24,343 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:24,348 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-04 15:45:24,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:24,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:24,350 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-04 15:45:24,350 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-04 15:45:24,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:24,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:24,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:24,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:24,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:24,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:24,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:24,364 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:24,370 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-04 15:45:24,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:24,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:24,378 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-04 15:45:24,378 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-04 15:45:24,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-04 15:45:24,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:24,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:24,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:24,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:24,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:24,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:24,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:24,390 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:24,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-04 15:45:24,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:24,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:24,399 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-04 15:45:24,400 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-04 15:45:24,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:24,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:24,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:24,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:24,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:24,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:24,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:24,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:24,412 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:24,417 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-04 15:45:24,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:24,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:24,419 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-04 15:45:24,420 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-04 15:45:24,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:24,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:24,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:24,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:24,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:24,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:24,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:24,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:24,433 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:24,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:24,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:24,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:24,441 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-04 15:45:24,441 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-04 15:45:24,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-04 15:45:24,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:24,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:24,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:24,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:24,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:24,453 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:24,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:24,454 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:24,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:24,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:24,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:24,461 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-04 15:45:24,462 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-04 15:45:24,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-04 15:45:24,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:24,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:24,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:24,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:24,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:24,473 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:24,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:24,474 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:24,479 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-04 15:45:24,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:24,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:24,481 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-04 15:45:24,482 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-04 15:45:24,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:24,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:24,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:24,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:24,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:24,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:24,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:24,496 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:24,501 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-04 15:45:24,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:24,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:24,504 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-04 15:45:24,505 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-04 15:45:24,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-04 15:45:24,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:24,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:24,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:24,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:24,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:24,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:24,519 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:24,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-04 15:45:24,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:24,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:24,526 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-04 15:45:24,527 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-04 15:45:24,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:24,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:24,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:24,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:24,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:24,540 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:24,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:24,542 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:24,547 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-04 15:45:24,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:24,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:24,549 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-04 15:45:24,551 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-04 15:45:24,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:24,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:24,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:24,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:24,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:24,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:24,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:24,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:24,563 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:24,569 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-04 15:45:24,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:24,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:24,571 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-04 15:45:24,571 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-04 15:45:24,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-04 15:45:24,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:24,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:24,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:24,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:24,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:24,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:24,594 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:45:24,610 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-03-04 15:45:24,610 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-04 15:45:24,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:24,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:24,612 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-04 15:45:24,613 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-04 15:45:24,614 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:45:24,625 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-04 15:45:24,625 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:45:24,626 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2#1, v_rep(select #length ULTIMATE.start_main_~B~0#1.base)_1) = -4*ULTIMATE.start_main_~i~2#1 + 1*v_rep(select #length ULTIMATE.start_main_~B~0#1.base)_1 Supporting invariants [1*ULTIMATE.start_main_~B~0#1.offset >= 0] [2025-03-04 15:45:24,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:24,653 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2025-03-04 15:45:24,655 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 15:45:24,656 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 15:45:24,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:24,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:45:24,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:45:24,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:24,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:24,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:45:24,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:24,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:45:24,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:45:24,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:24,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:24,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:45:24,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:24,719 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-04 15:45:24,719 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2025-03-04 15:45:24,719 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-04 15:45:24,736 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 15 states and 23 transitions. Complement of second has 4 states. [2025-03-04 15:45:24,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-04 15:45:24,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-04 15:45:24,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2025-03-04 15:45:24,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 7 letters. Loop has 1 letters. [2025-03-04 15:45:24,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:24,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 1 letters. [2025-03-04 15:45:24,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:24,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 7 letters. Loop has 2 letters. [2025-03-04 15:45:24,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:24,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2025-03-04 15:45:24,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:45:24,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 23 transitions. [2025-03-04 15:45:24,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-04 15:45:24,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-04 15:45:24,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 23 transitions. [2025-03-04 15:45:24,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:45:24,740 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 23 transitions. [2025-03-04 15:45:24,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 23 transitions. [2025-03-04 15:45:24,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-03-04 15:45:24,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 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-04 15:45:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 22 transitions. [2025-03-04 15:45:24,741 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 22 transitions. [2025-03-04 15:45:24,741 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 22 transitions. [2025-03-04 15:45:24,741 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:45:24,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 22 transitions. [2025-03-04 15:45:24,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:45:24,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:24,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:24,743 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:45:24,743 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 15:45:24,743 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~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~i~1#1, main_#t~nondet15#1, main_#t~post16#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;havoc main_#t~nondet8#1;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;" "assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911);" "assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1 % 4294967296);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1 % 4294967296);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1 % 4294967296);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~Alen~0#1;havoc main_#t~nondet13#1;call write~int#2(main_#t~nondet13#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~i~1#1 < main_~Alen~0#1);havoc main_~i~1#1;main_~i~2#1 := 0;" "assume !(main_~i~2#1 < main_~Blen~0#1);havoc main_~i~2#1;assume { :begin_inline_diff } true;diff_#in~A#1.base, diff_#in~A#1.offset, diff_#in~Alen#1, diff_#in~B#1.base, diff_#in~B#1.offset, diff_#in~Blen#1, diff_#in~D#1.base, diff_#in~D#1.offset := main_~A~0#1.base, main_~A~0#1.offset, main_~Alen~0#1, main_~B~0#1.base, main_~B~0#1.offset, main_~Blen~0#1, main_~D~0#1.base, main_~D~0#1.offset;havoc diff_#t~mem2#1, diff_#t~mem3#1, diff_#t~post4#1, diff_#t~mem5#1, diff_#t~post6#1, diff_#t~post7#1, diff_~j~0#1, diff_~A#1.base, diff_~A#1.offset, diff_~Alen#1, diff_~B#1.base, diff_~B#1.offset, diff_~Blen#1, diff_~D#1.base, diff_~D#1.offset, diff_~k~0#1, diff_~i~0#1, diff_~l1~0#1, diff_~l2~0#1, diff_~found~0#1;diff_~A#1.base, diff_~A#1.offset := diff_#in~A#1.base, diff_#in~A#1.offset;diff_~Alen#1 := diff_#in~Alen#1;diff_~B#1.base, diff_~B#1.offset := diff_#in~B#1.base, diff_#in~B#1.offset;diff_~Blen#1 := diff_#in~Blen#1;diff_~D#1.base, diff_~D#1.offset := diff_#in~D#1.base, diff_#in~D#1.offset;diff_~k~0#1 := 0;diff_~i~0#1 := 0;diff_~l1~0#1 := diff_~Alen#1;diff_~l2~0#1 := diff_~Blen#1;havoc diff_~found~0#1;" [2025-03-04 15:45:24,743 INFO L754 eck$LassoCheckResult]: Loop: "assume diff_~i~0#1 < diff_~l1~0#1;diff_~j~0#1 := 0;diff_~found~0#1 := 0;" "assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1);" "assume 0 == diff_~found~0#1;call diff_#t~mem5#1 := read~int#2(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call write~int#1(diff_#t~mem5#1, diff_~D#1.base, diff_~D#1.offset + 4 * diff_~k~0#1, 4);havoc diff_#t~mem5#1;diff_#t~post6#1 := diff_~k~0#1;diff_~k~0#1 := 1 + diff_#t~post6#1;havoc diff_#t~post6#1;" "diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_~j~0#1;havoc diff_#t~post7#1;" [2025-03-04 15:45:24,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:24,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1707996549, now seen corresponding path program 1 times [2025-03-04 15:45:24,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:24,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617375983] [2025-03-04 15:45:24,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:24,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:24,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:45:24,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:45:24,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:24,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:24,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:45:24,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:45:24,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617375983] [2025-03-04 15:45:24,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617375983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:45:24,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:45:24,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:45:24,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692981543] [2025-03-04 15:45:24,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:45:24,792 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:45:24,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:24,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1260991, now seen corresponding path program 1 times [2025-03-04 15:45:24,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:24,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635219555] [2025-03-04 15:45:24,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:24,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:24,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:45:24,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:45:24,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:24,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:24,798 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:24,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:45:24,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:45:24,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:24,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:24,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:24,867 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-04 15:45:24,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:45:24,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:45:24,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:45:24,920 INFO L87 Difference]: Start difference. First operand 14 states and 22 transitions. cyclomatic complexity: 11 Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:45:24,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:45:24,929 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. [2025-03-04 15:45:24,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 21 transitions. [2025-03-04 15:45:24,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:45:24,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 21 transitions. [2025-03-04 15:45:24,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-04 15:45:24,929 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-03-04 15:45:24,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 21 transitions. [2025-03-04 15:45:24,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:45:24,930 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 21 transitions. [2025-03-04 15:45:24,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 21 transitions. [2025-03-04 15:45:24,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-04 15:45:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 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-04 15:45:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2025-03-04 15:45:24,930 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 21 transitions. [2025-03-04 15:45:24,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:45:24,931 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2025-03-04 15:45:24,931 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:45:24,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2025-03-04 15:45:24,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:45:24,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:24,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:24,932 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:45:24,932 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 15:45:24,932 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~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~i~1#1, main_#t~nondet15#1, main_#t~post16#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;havoc main_#t~nondet8#1;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;" "assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911);" "assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1 % 4294967296);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1 % 4294967296);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1 % 4294967296);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~Alen~0#1;havoc main_#t~nondet13#1;call write~int#2(main_#t~nondet13#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~i~1#1 < main_~Alen~0#1);havoc main_~i~1#1;main_~i~2#1 := 0;" "assume main_~i~2#1 < main_~Blen~0#1;havoc main_#t~nondet15#1;call write~int#0(main_#t~nondet15#1, main_~B~0#1.base, main_~B~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~nondet15#1;main_#t~post16#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1;" "assume !(main_~i~2#1 < main_~Blen~0#1);havoc main_~i~2#1;assume { :begin_inline_diff } true;diff_#in~A#1.base, diff_#in~A#1.offset, diff_#in~Alen#1, diff_#in~B#1.base, diff_#in~B#1.offset, diff_#in~Blen#1, diff_#in~D#1.base, diff_#in~D#1.offset := main_~A~0#1.base, main_~A~0#1.offset, main_~Alen~0#1, main_~B~0#1.base, main_~B~0#1.offset, main_~Blen~0#1, main_~D~0#1.base, main_~D~0#1.offset;havoc diff_#t~mem2#1, diff_#t~mem3#1, diff_#t~post4#1, diff_#t~mem5#1, diff_#t~post6#1, diff_#t~post7#1, diff_~j~0#1, diff_~A#1.base, diff_~A#1.offset, diff_~Alen#1, diff_~B#1.base, diff_~B#1.offset, diff_~Blen#1, diff_~D#1.base, diff_~D#1.offset, diff_~k~0#1, diff_~i~0#1, diff_~l1~0#1, diff_~l2~0#1, diff_~found~0#1;diff_~A#1.base, diff_~A#1.offset := diff_#in~A#1.base, diff_#in~A#1.offset;diff_~Alen#1 := diff_#in~Alen#1;diff_~B#1.base, diff_~B#1.offset := diff_#in~B#1.base, diff_#in~B#1.offset;diff_~Blen#1 := diff_#in~Blen#1;diff_~D#1.base, diff_~D#1.offset := diff_#in~D#1.base, diff_#in~D#1.offset;diff_~k~0#1 := 0;diff_~i~0#1 := 0;diff_~l1~0#1 := diff_~Alen#1;diff_~l2~0#1 := diff_~Blen#1;havoc diff_~found~0#1;" [2025-03-04 15:45:24,932 INFO L754 eck$LassoCheckResult]: Loop: "assume diff_~i~0#1 < diff_~l1~0#1;diff_~j~0#1 := 0;diff_~found~0#1 := 0;" "assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1);" "assume 0 == diff_~found~0#1;call diff_#t~mem5#1 := read~int#2(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call write~int#1(diff_#t~mem5#1, diff_~D#1.base, diff_~D#1.offset + 4 * diff_~k~0#1, 4);havoc diff_#t~mem5#1;diff_#t~post6#1 := diff_~k~0#1;diff_~k~0#1 := 1 + diff_#t~post6#1;havoc diff_#t~post6#1;" "diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_~j~0#1;havoc diff_#t~post7#1;" [2025-03-04 15:45:24,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:24,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1408285423, now seen corresponding path program 1 times [2025-03-04 15:45:24,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:24,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32322394] [2025-03-04 15:45:24,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:24,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:24,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:45:24,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:45:24,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:24,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:24,959 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:24,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:45:24,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:45:24,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:24,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:24,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:24,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:24,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1260991, now seen corresponding path program 2 times [2025-03-04 15:45:24,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:24,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030056399] [2025-03-04 15:45:24,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:45:24,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:24,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:45:24,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:45:24,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:45:24,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:24,988 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:24,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:45:24,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:45:24,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:24,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:24,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:24,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:24,994 INFO L85 PathProgramCache]: Analyzing trace with hash -640058673, now seen corresponding path program 1 times [2025-03-04 15:45:24,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:24,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597229457] [2025-03-04 15:45:24,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:24,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:25,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:45:25,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:45:25,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:25,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:25,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:45:25,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:45:25,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597229457] [2025-03-04 15:45:25,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597229457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:45:25,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:45:25,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:45:25,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322100245] [2025-03-04 15:45:25,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:45:25,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:45:25,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:45:25,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:45:25,177 INFO L87 Difference]: Start difference. First operand 14 states and 21 transitions. cyclomatic complexity: 10 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-04 15:45:25,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:45:25,199 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2025-03-04 15:45:25,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 24 transitions. [2025-03-04 15:45:25,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:45:25,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 24 transitions. [2025-03-04 15:45:25,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-03-04 15:45:25,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-03-04 15:45:25,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 24 transitions. [2025-03-04 15:45:25,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:45:25,200 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 24 transitions. [2025-03-04 15:45:25,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 24 transitions. [2025-03-04 15:45:25,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-03-04 15:45:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 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-04 15:45:25,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2025-03-04 15:45:25,201 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 22 transitions. [2025-03-04 15:45:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:45:25,203 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2025-03-04 15:45:25,204 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:45:25,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2025-03-04 15:45:25,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:45:25,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:25,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:25,205 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:45:25,205 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:45:25,205 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~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~i~1#1, main_#t~nondet15#1, main_#t~post16#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;havoc main_#t~nondet8#1;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;" "assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911);" "assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1 % 4294967296);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1 % 4294967296);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1 % 4294967296);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~Alen~0#1;havoc main_#t~nondet13#1;call write~int#2(main_#t~nondet13#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~i~1#1 < main_~Alen~0#1);havoc main_~i~1#1;main_~i~2#1 := 0;" "assume main_~i~2#1 < main_~Blen~0#1;havoc main_#t~nondet15#1;call write~int#0(main_#t~nondet15#1, main_~B~0#1.base, main_~B~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~nondet15#1;main_#t~post16#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1;" "assume !(main_~i~2#1 < main_~Blen~0#1);havoc main_~i~2#1;assume { :begin_inline_diff } true;diff_#in~A#1.base, diff_#in~A#1.offset, diff_#in~Alen#1, diff_#in~B#1.base, diff_#in~B#1.offset, diff_#in~Blen#1, diff_#in~D#1.base, diff_#in~D#1.offset := main_~A~0#1.base, main_~A~0#1.offset, main_~Alen~0#1, main_~B~0#1.base, main_~B~0#1.offset, main_~Blen~0#1, main_~D~0#1.base, main_~D~0#1.offset;havoc diff_#t~mem2#1, diff_#t~mem3#1, diff_#t~post4#1, diff_#t~mem5#1, diff_#t~post6#1, diff_#t~post7#1, diff_~j~0#1, diff_~A#1.base, diff_~A#1.offset, diff_~Alen#1, diff_~B#1.base, diff_~B#1.offset, diff_~Blen#1, diff_~D#1.base, diff_~D#1.offset, diff_~k~0#1, diff_~i~0#1, diff_~l1~0#1, diff_~l2~0#1, diff_~found~0#1;diff_~A#1.base, diff_~A#1.offset := diff_#in~A#1.base, diff_#in~A#1.offset;diff_~Alen#1 := diff_#in~Alen#1;diff_~B#1.base, diff_~B#1.offset := diff_#in~B#1.base, diff_#in~B#1.offset;diff_~Blen#1 := diff_#in~Blen#1;diff_~D#1.base, diff_~D#1.offset := diff_#in~D#1.base, diff_#in~D#1.offset;diff_~k~0#1 := 0;diff_~i~0#1 := 0;diff_~l1~0#1 := diff_~Alen#1;diff_~l2~0#1 := diff_~Blen#1;havoc diff_~found~0#1;" [2025-03-04 15:45:25,205 INFO L754 eck$LassoCheckResult]: Loop: "assume diff_~i~0#1 < diff_~l1~0#1;diff_~j~0#1 := 0;diff_~found~0#1 := 0;" "assume diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1;call diff_#t~mem2#1 := read~int#2(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call diff_#t~mem3#1 := read~int#0(diff_~B#1.base, diff_~B#1.offset + 4 * diff_~j~0#1, 4);" "assume diff_#t~mem2#1 == diff_#t~mem3#1;havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_~found~0#1 := 1;" "assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1);" "assume 0 == diff_~found~0#1;call diff_#t~mem5#1 := read~int#2(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call write~int#1(diff_#t~mem5#1, diff_~D#1.base, diff_~D#1.offset + 4 * diff_~k~0#1, 4);havoc diff_#t~mem5#1;diff_#t~post6#1 := diff_~k~0#1;diff_~k~0#1 := 1 + diff_#t~post6#1;havoc diff_#t~post6#1;" "diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_~j~0#1;havoc diff_#t~post7#1;" [2025-03-04 15:45:25,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:25,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1408285423, now seen corresponding path program 2 times [2025-03-04 15:45:25,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:25,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899835202] [2025-03-04 15:45:25,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:45:25,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:25,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-03-04 15:45:25,230 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:45:25,231 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:45:25,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:25,232 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:25,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:45:25,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:45:25,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:25,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:25,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:25,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:25,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1210954337, now seen corresponding path program 1 times [2025-03-04 15:45:25,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:25,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357251707] [2025-03-04 15:45:25,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:25,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:25,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:45:25,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:45:25,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:25,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:25,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:25,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:45:25,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357251707] [2025-03-04 15:45:25,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357251707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:45:25,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:45:25,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:45:25,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90297798] [2025-03-04 15:45:25,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:45:25,279 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:45:25,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:45:25,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:45:25,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:45:25,279 INFO L87 Difference]: Start difference. First operand 15 states and 22 transitions. cyclomatic complexity: 10 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:45:25,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:45:25,300 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. [2025-03-04 15:45:25,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 24 transitions. [2025-03-04 15:45:25,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-04 15:45:25,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 24 transitions. [2025-03-04 15:45:25,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-03-04 15:45:25,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-03-04 15:45:25,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2025-03-04 15:45:25,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:45:25,301 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 24 transitions. [2025-03-04 15:45:25,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2025-03-04 15:45:25,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-04 15:45:25,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 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-04 15:45:25,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2025-03-04 15:45:25,302 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 24 transitions. [2025-03-04 15:45:25,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:45:25,304 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2025-03-04 15:45:25,304 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 15:45:25,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2025-03-04 15:45:25,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-04 15:45:25,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:25,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:25,304 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:45:25,304 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:45:25,304 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~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~i~1#1, main_#t~nondet15#1, main_#t~post16#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;havoc main_#t~nondet8#1;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;" "assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911);" "assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1 % 4294967296);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1 % 4294967296);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1 % 4294967296);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~Alen~0#1;havoc main_#t~nondet13#1;call write~int#2(main_#t~nondet13#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~i~1#1 < main_~Alen~0#1);havoc main_~i~1#1;main_~i~2#1 := 0;" "assume main_~i~2#1 < main_~Blen~0#1;havoc main_#t~nondet15#1;call write~int#0(main_#t~nondet15#1, main_~B~0#1.base, main_~B~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~nondet15#1;main_#t~post16#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1;" "assume !(main_~i~2#1 < main_~Blen~0#1);havoc main_~i~2#1;assume { :begin_inline_diff } true;diff_#in~A#1.base, diff_#in~A#1.offset, diff_#in~Alen#1, diff_#in~B#1.base, diff_#in~B#1.offset, diff_#in~Blen#1, diff_#in~D#1.base, diff_#in~D#1.offset := main_~A~0#1.base, main_~A~0#1.offset, main_~Alen~0#1, main_~B~0#1.base, main_~B~0#1.offset, main_~Blen~0#1, main_~D~0#1.base, main_~D~0#1.offset;havoc diff_#t~mem2#1, diff_#t~mem3#1, diff_#t~post4#1, diff_#t~mem5#1, diff_#t~post6#1, diff_#t~post7#1, diff_~j~0#1, diff_~A#1.base, diff_~A#1.offset, diff_~Alen#1, diff_~B#1.base, diff_~B#1.offset, diff_~Blen#1, diff_~D#1.base, diff_~D#1.offset, diff_~k~0#1, diff_~i~0#1, diff_~l1~0#1, diff_~l2~0#1, diff_~found~0#1;diff_~A#1.base, diff_~A#1.offset := diff_#in~A#1.base, diff_#in~A#1.offset;diff_~Alen#1 := diff_#in~Alen#1;diff_~B#1.base, diff_~B#1.offset := diff_#in~B#1.base, diff_#in~B#1.offset;diff_~Blen#1 := diff_#in~Blen#1;diff_~D#1.base, diff_~D#1.offset := diff_#in~D#1.base, diff_#in~D#1.offset;diff_~k~0#1 := 0;diff_~i~0#1 := 0;diff_~l1~0#1 := diff_~Alen#1;diff_~l2~0#1 := diff_~Blen#1;havoc diff_~found~0#1;" [2025-03-04 15:45:25,305 INFO L754 eck$LassoCheckResult]: Loop: "assume diff_~i~0#1 < diff_~l1~0#1;diff_~j~0#1 := 0;diff_~found~0#1 := 0;" "assume diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1;call diff_#t~mem2#1 := read~int#2(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call diff_#t~mem3#1 := read~int#0(diff_~B#1.base, diff_~B#1.offset + 4 * diff_~j~0#1, 4);" "assume diff_#t~mem2#1 == diff_#t~mem3#1;havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_~found~0#1 := 1;" "assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1);" "assume !(0 == diff_~found~0#1);" "diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_~j~0#1;havoc diff_#t~post7#1;" [2025-03-04 15:45:25,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:25,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1408285423, now seen corresponding path program 3 times [2025-03-04 15:45:25,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:25,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400619021] [2025-03-04 15:45:25,305 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:45:25,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:25,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 9 statements into 2 equivalence classes. [2025-03-04 15:45:25,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:45:25,331 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 15:45:25,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:25,331 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:25,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:45:25,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:45:25,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:25,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:25,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:25,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:25,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1210954368, now seen corresponding path program 1 times [2025-03-04 15:45:25,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:25,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781042007] [2025-03-04 15:45:25,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:25,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:25,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:45:25,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:45:25,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:25,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:25,350 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:25,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:45:25,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:45:25,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:25,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:25,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:25,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:25,356 INFO L85 PathProgramCache]: Analyzing trace with hash -916919408, now seen corresponding path program 1 times [2025-03-04 15:45:25,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:25,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370822579] [2025-03-04 15:45:25,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:25,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:25,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:45:25,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:45:25,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:25,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:25,373 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:25,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:45:25,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:45:25,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:25,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:25,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:26,045 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:45:26,045 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:45:26,045 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:45:26,045 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:45:26,045 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:45:26,045 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:26,045 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:45:26,045 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:45:26,045 INFO L132 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration7_Lasso [2025-03-04 15:45:26,045 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:45:26,045 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:45:26,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:26,531 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:45:26,531 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:45:26,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:26,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:26,533 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-04 15:45:26,534 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-04 15:45:26,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-04 15:45:26,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:26,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:26,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:26,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:26,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:26,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:26,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:26,546 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:26,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-04 15:45:26,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:26,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:26,554 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-04 15:45:26,554 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-04 15:45:26,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:26,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:26,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:26,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:26,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:26,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:26,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:26,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:26,568 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:26,573 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-04 15:45:26,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:26,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:26,575 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-04 15:45:26,576 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-04 15:45:26,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-04 15:45:26,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:26,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:26,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:26,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:26,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:26,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:26,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:26,588 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:26,593 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-04 15:45:26,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:26,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:26,595 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-04 15:45:26,595 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-04 15:45:26,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:26,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:26,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:26,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:26,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:26,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:26,606 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:26,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:26,607 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:26,612 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-04 15:45:26,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:26,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:26,614 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-04 15:45:26,615 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-04 15:45:26,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-04 15:45:26,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:26,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:26,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:26,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:26,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:26,626 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:26,628 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:26,634 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-04 15:45:26,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:26,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:26,635 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-04 15:45:26,636 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-04 15:45:26,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-04 15:45:26,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:26,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:26,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:26,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:26,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:26,647 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:26,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:26,647 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:26,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-04 15:45:26,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:26,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:26,654 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-04 15:45:26,655 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-04 15:45:26,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:26,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:26,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:26,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:26,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:26,666 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:26,666 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:26,668 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:26,674 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-04 15:45:26,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:26,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:26,675 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-04 15:45:26,676 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-04 15:45:26,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-04 15:45:26,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:26,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:26,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:26,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:26,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:26,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:26,693 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:26,698 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-04 15:45:26,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:26,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:26,700 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-04 15:45:26,701 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-04 15:45:26,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:26,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:26,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:26,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:26,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:26,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:26,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:26,718 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:26,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-04 15:45:26,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:26,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:26,725 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-04 15:45:26,726 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-04 15:45:26,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:26,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:26,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:26,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:26,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:26,738 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:26,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:26,740 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:26,745 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-04 15:45:26,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:26,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:26,747 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-04 15:45:26,748 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-04 15:45:26,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:26,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:26,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:26,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:26,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:26,759 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:26,759 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:26,762 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:26,767 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-04 15:45:26,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:26,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:26,769 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-04 15:45:26,770 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-04 15:45:26,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:26,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:26,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:26,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:26,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:26,783 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:26,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:26,786 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:26,793 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-04 15:45:26,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:26,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:26,795 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-04 15:45:26,795 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-04 15:45:26,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:26,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:26,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:26,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:26,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:26,810 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:26,810 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:26,815 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:26,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:26,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:26,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:26,839 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-04 15:45:26,839 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-04 15:45:26,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:26,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:26,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:26,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:26,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:26,850 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:26,850 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:26,852 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:26,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-04 15:45:26,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:26,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:26,859 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-04 15:45:26,860 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-04 15:45:26,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:26,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:26,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:26,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:26,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:26,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:26,873 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:26,879 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:45:26,895 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-04 15:45:26,895 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2025-03-04 15:45:26,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:26,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:26,897 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-04 15:45:26,897 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-04 15:45:26,899 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:45:26,909 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:45:26,909 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:45:26,909 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~l1~0#1, ULTIMATE.start_diff_~i~0#1) = 1*ULTIMATE.start_diff_~l1~0#1 - 1*ULTIMATE.start_diff_~i~0#1 Supporting invariants [] [2025-03-04 15:45:26,914 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-04 15:45:26,939 INFO L156 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2025-03-04 15:45:26,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:26,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:45:26,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:45:26,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:26,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:26,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:45:26,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:26,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:45:26,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:45:26,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:26,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:26,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:45:26,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:27,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:45:27,010 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:45:27,010 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-04 15:45:27,028 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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 25 states and 36 transitions. Complement of second has 4 states. [2025-03-04 15:45:27,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:45:27,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-04 15:45:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2025-03-04 15:45:27,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 9 letters. Loop has 6 letters. [2025-03-04 15:45:27,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:27,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 15 letters. Loop has 6 letters. [2025-03-04 15:45:27,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:27,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 9 letters. Loop has 12 letters. [2025-03-04 15:45:27,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:27,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 36 transitions. [2025-03-04 15:45:27,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:27,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 30 transitions. [2025-03-04 15:45:27,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-04 15:45:27,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-04 15:45:27,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2025-03-04 15:45:27,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:27,031 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 30 transitions. [2025-03-04 15:45:27,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2025-03-04 15:45:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2025-03-04 15:45:27,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 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-04 15:45:27,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2025-03-04 15:45:27,032 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2025-03-04 15:45:27,032 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2025-03-04 15:45:27,032 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 15:45:27,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2025-03-04 15:45:27,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:27,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:27,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:27,032 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:45:27,032 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:27,032 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~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~i~1#1, main_#t~nondet15#1, main_#t~post16#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;havoc main_#t~nondet8#1;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;" "assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911);" "assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1 % 4294967296);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1 % 4294967296);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1 % 4294967296);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~Alen~0#1;havoc main_#t~nondet13#1;call write~int#2(main_#t~nondet13#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~i~1#1 < main_~Alen~0#1);havoc main_~i~1#1;main_~i~2#1 := 0;" "assume main_~i~2#1 < main_~Blen~0#1;havoc main_#t~nondet15#1;call write~int#0(main_#t~nondet15#1, main_~B~0#1.base, main_~B~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~nondet15#1;main_#t~post16#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1;" "assume !(main_~i~2#1 < main_~Blen~0#1);havoc main_~i~2#1;assume { :begin_inline_diff } true;diff_#in~A#1.base, diff_#in~A#1.offset, diff_#in~Alen#1, diff_#in~B#1.base, diff_#in~B#1.offset, diff_#in~Blen#1, diff_#in~D#1.base, diff_#in~D#1.offset := main_~A~0#1.base, main_~A~0#1.offset, main_~Alen~0#1, main_~B~0#1.base, main_~B~0#1.offset, main_~Blen~0#1, main_~D~0#1.base, main_~D~0#1.offset;havoc diff_#t~mem2#1, diff_#t~mem3#1, diff_#t~post4#1, diff_#t~mem5#1, diff_#t~post6#1, diff_#t~post7#1, diff_~j~0#1, diff_~A#1.base, diff_~A#1.offset, diff_~Alen#1, diff_~B#1.base, diff_~B#1.offset, diff_~Blen#1, diff_~D#1.base, diff_~D#1.offset, diff_~k~0#1, diff_~i~0#1, diff_~l1~0#1, diff_~l2~0#1, diff_~found~0#1;diff_~A#1.base, diff_~A#1.offset := diff_#in~A#1.base, diff_#in~A#1.offset;diff_~Alen#1 := diff_#in~Alen#1;diff_~B#1.base, diff_~B#1.offset := diff_#in~B#1.base, diff_#in~B#1.offset;diff_~Blen#1 := diff_#in~Blen#1;diff_~D#1.base, diff_~D#1.offset := diff_#in~D#1.base, diff_#in~D#1.offset;diff_~k~0#1 := 0;diff_~i~0#1 := 0;diff_~l1~0#1 := diff_~Alen#1;diff_~l2~0#1 := diff_~Blen#1;havoc diff_~found~0#1;" "assume diff_~i~0#1 < diff_~l1~0#1;diff_~j~0#1 := 0;diff_~found~0#1 := 0;" [2025-03-04 15:45:27,033 INFO L754 eck$LassoCheckResult]: Loop: "assume diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1;call diff_#t~mem2#1 := read~int#2(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call diff_#t~mem3#1 := read~int#0(diff_~B#1.base, diff_~B#1.offset + 4 * diff_~j~0#1, 4);" "assume !(diff_#t~mem2#1 == diff_#t~mem3#1);havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_#t~post4#1 := diff_~j~0#1;diff_~j~0#1 := 1 + diff_#t~post4#1;havoc diff_#t~post4#1;" [2025-03-04 15:45:27,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:27,033 INFO L85 PathProgramCache]: Analyzing trace with hash -707175142, now seen corresponding path program 1 times [2025-03-04 15:45:27,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:27,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462587019] [2025-03-04 15:45:27,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:27,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:27,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:45:27,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:45:27,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:27,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:27,047 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:27,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:45:27,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:45:27,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:27,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:27,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:27,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:27,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 1 times [2025-03-04 15:45:27,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:27,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007581] [2025-03-04 15:45:27,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:27,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:27,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:27,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:27,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:27,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:27,071 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:27,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:27,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:27,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:27,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:27,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:27,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:27,074 INFO L85 PathProgramCache]: Analyzing trace with hash -990478407, now seen corresponding path program 1 times [2025-03-04 15:45:27,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:27,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766188820] [2025-03-04 15:45:27,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:27,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:27,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:45:27,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:45:27,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:27,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:27,085 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:27,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:45:27,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:45:27,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:27,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:27,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:27,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-04 15:45:27,959 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:45:27,959 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:45:27,959 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:45:27,959 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:45:27,959 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:45:27,959 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:27,959 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:45:27,959 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:45:27,959 INFO L132 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration8_Lasso [2025-03-04 15:45:27,959 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:45:27,959 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:45:27,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:27,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:27,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:27,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:27,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:27,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:27,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:27,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:27,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:27,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:27,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:27,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:27,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:27,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:27,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:27,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:27,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:27,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:27,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:28,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:28,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:28,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:28,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:28,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:28,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:28,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:28,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:28,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:28,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:28,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:28,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:28,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:28,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:28,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:28,501 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:45:28,502 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:45:28,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:28,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:28,503 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-04 15:45:28,505 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-04 15:45:28,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-04 15:45:28,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:28,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:28,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:28,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:28,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:28,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:28,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:28,517 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:28,522 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-04 15:45:28,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:28,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:28,524 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-04 15:45:28,525 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-04 15:45:28,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:28,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:28,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:28,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:28,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:28,536 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:28,536 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:28,539 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:28,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-04 15:45:28,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:28,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:28,550 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-04 15:45:28,552 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-04 15:45:28,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-04 15:45:28,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:28,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:28,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:28,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:28,566 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:28,566 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:28,568 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:28,578 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-04 15:45:28,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:28,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:28,580 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-04 15:45:28,581 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-04 15:45:28,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:28,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:28,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:28,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:28,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:28,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:28,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:28,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:28,596 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:28,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-03-04 15:45:28,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:28,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:28,606 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-04 15:45:28,606 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-04 15:45:28,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-04 15:45:28,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:28,619 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:28,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:28,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:28,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:28,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:28,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:28,621 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:28,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:28,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:28,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:28,629 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-04 15:45:28,631 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-04 15:45:28,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-04 15:45:28,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:28,641 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:28,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:28,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:28,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:28,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:28,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:28,642 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:28,647 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-04 15:45:28,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:28,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:28,649 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-04 15:45:28,650 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-04 15:45:28,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:28,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:28,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:28,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:28,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:28,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:28,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:28,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:28,661 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:28,666 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-04 15:45:28,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:28,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:28,669 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-04 15:45:28,670 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-04 15:45:28,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:28,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:28,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:28,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:28,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:28,681 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:28,681 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:28,683 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:28,689 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-04 15:45:28,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:28,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:28,691 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-04 15:45:28,692 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-04 15:45:28,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:28,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:28,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:28,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:28,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:28,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:28,703 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:28,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:28,704 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:28,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:28,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:28,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:28,711 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-04 15:45:28,711 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-04 15:45:28,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-04 15:45:28,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:28,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:28,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:28,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:28,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:28,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:28,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:28,723 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:28,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-04 15:45:28,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:28,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:28,730 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-04 15:45:28,731 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-04 15:45:28,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:28,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:28,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:28,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:28,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:28,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:28,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:28,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:28,743 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:28,748 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-04 15:45:28,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:28,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:28,750 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-04 15:45:28,750 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-04 15:45:28,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:28,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:28,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:28,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:28,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:28,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:28,761 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:28,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:28,762 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:28,768 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-04 15:45:28,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:28,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:28,770 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-04 15:45:28,770 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-04 15:45:28,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:28,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:28,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:28,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:28,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:28,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:28,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:28,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:28,782 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:28,787 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-04 15:45:28,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:28,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:28,789 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-04 15:45:28,789 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-04 15:45:28,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:28,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:28,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:28,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:28,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:28,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:28,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:28,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:28,801 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:28,807 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-04 15:45:28,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:28,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:28,808 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-04 15:45:28,810 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-04 15:45:28,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-04 15:45:28,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:28,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:28,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:28,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:28,822 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:28,822 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:28,824 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:28,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:28,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:28,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:28,831 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-04 15:45:28,831 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-04 15:45:28,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:28,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:28,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:28,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:28,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:28,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:28,843 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:28,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:28,843 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:28,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:28,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:28,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:28,851 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-04 15:45:28,851 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-04 15:45:28,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:28,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:28,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:28,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:28,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:28,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:28,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:28,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:28,863 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:28,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-03-04 15:45:28,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:28,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:28,870 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-04 15:45:28,871 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-04 15:45:28,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:28,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:28,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:28,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:28,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:28,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:28,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:28,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:28,883 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:28,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:28,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:28,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:28,890 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-04 15:45:28,890 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-04 15:45:28,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:28,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:28,901 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:28,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:28,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:28,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:28,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:28,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:28,902 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:28,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:28,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:28,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:28,910 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-04 15:45:28,910 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-04 15:45:28,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:28,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:28,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:28,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:28,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:28,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:28,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:28,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:28,923 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:28,928 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-04 15:45:28,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:28,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:28,931 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-04 15:45:28,931 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-04 15:45:28,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:28,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:28,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:28,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:28,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:28,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:28,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:28,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:28,943 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:28,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-04 15:45:28,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:28,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:28,951 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-04 15:45:28,952 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-04 15:45:28,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:28,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:28,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:28,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:28,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:28,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:28,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:28,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:28,963 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:28,969 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-04 15:45:28,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:28,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:28,970 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-04 15:45:28,971 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-04 15:45:28,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:28,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:28,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:28,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:28,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:28,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:28,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:28,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:28,983 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:28,988 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-04 15:45:28,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:28,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:28,990 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-04 15:45:28,999 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-04 15:45:28,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:29,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:29,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:29,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:29,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:29,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:29,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:29,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:29,010 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:29,016 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-04 15:45:29,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:29,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:29,018 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-04 15:45:29,020 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-04 15:45:29,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:29,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:29,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:29,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:29,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:29,033 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:29,033 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:29,037 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:29,043 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-04 15:45:29,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:29,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:29,045 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-04 15:45:29,046 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-04 15:45:29,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-04 15:45:29,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:29,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:29,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:29,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:29,064 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:29,064 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:29,071 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:45:29,088 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-04 15:45:29,088 INFO L444 ModelExtractionUtils]: 2 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2025-03-04 15:45:29,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:29,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:29,090 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-04 15:45:29,092 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-04 15:45:29,093 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:45:29,104 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:45:29,104 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:45:29,104 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~j~0#1, ULTIMATE.start_diff_~l2~0#1) = -1*ULTIMATE.start_diff_~j~0#1 + 1*ULTIMATE.start_diff_~l2~0#1 Supporting invariants [] [2025-03-04 15:45:29,110 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-04 15:45:29,146 INFO L156 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2025-03-04 15:45:29,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:29,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:45:29,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:45:29,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:29,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:29,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:45:29,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:29,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:29,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:29,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:29,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:29,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:45:29,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:29,207 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-04 15:45:29,208 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:45:29,208 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-04 15:45:29,220 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 13. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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 30 states and 43 transitions. Complement of second has 5 states. [2025-03-04 15:45:29,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:45:29,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-04 15:45:29,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2025-03-04 15:45:29,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 2 letters. [2025-03-04 15:45:29,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:29,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 12 letters. Loop has 2 letters. [2025-03-04 15:45:29,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:29,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 4 letters. [2025-03-04 15:45:29,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:29,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 43 transitions. [2025-03-04 15:45:29,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:29,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 25 states and 36 transitions. [2025-03-04 15:45:29,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-04 15:45:29,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:45:29,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 36 transitions. [2025-03-04 15:45:29,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:29,222 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 36 transitions. [2025-03-04 15:45:29,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 36 transitions. [2025-03-04 15:45:29,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2025-03-04 15:45:29,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 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-04 15:45:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2025-03-04 15:45:29,223 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 35 transitions. [2025-03-04 15:45:29,223 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2025-03-04 15:45:29,223 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 15:45:29,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. [2025-03-04 15:45:29,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:29,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:29,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:29,224 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:45:29,224 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:29,224 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~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~i~1#1, main_#t~nondet15#1, main_#t~post16#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;havoc main_#t~nondet8#1;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;" "assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911);" "assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1 % 4294967296);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1 % 4294967296);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1 % 4294967296);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~Alen~0#1;havoc main_#t~nondet13#1;call write~int#2(main_#t~nondet13#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~i~1#1 < main_~Alen~0#1);havoc main_~i~1#1;main_~i~2#1 := 0;" "assume main_~i~2#1 < main_~Blen~0#1;havoc main_#t~nondet15#1;call write~int#0(main_#t~nondet15#1, main_~B~0#1.base, main_~B~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~nondet15#1;main_#t~post16#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1;" "assume !(main_~i~2#1 < main_~Blen~0#1);havoc main_~i~2#1;assume { :begin_inline_diff } true;diff_#in~A#1.base, diff_#in~A#1.offset, diff_#in~Alen#1, diff_#in~B#1.base, diff_#in~B#1.offset, diff_#in~Blen#1, diff_#in~D#1.base, diff_#in~D#1.offset := main_~A~0#1.base, main_~A~0#1.offset, main_~Alen~0#1, main_~B~0#1.base, main_~B~0#1.offset, main_~Blen~0#1, main_~D~0#1.base, main_~D~0#1.offset;havoc diff_#t~mem2#1, diff_#t~mem3#1, diff_#t~post4#1, diff_#t~mem5#1, diff_#t~post6#1, diff_#t~post7#1, diff_~j~0#1, diff_~A#1.base, diff_~A#1.offset, diff_~Alen#1, diff_~B#1.base, diff_~B#1.offset, diff_~Blen#1, diff_~D#1.base, diff_~D#1.offset, diff_~k~0#1, diff_~i~0#1, diff_~l1~0#1, diff_~l2~0#1, diff_~found~0#1;diff_~A#1.base, diff_~A#1.offset := diff_#in~A#1.base, diff_#in~A#1.offset;diff_~Alen#1 := diff_#in~Alen#1;diff_~B#1.base, diff_~B#1.offset := diff_#in~B#1.base, diff_#in~B#1.offset;diff_~Blen#1 := diff_#in~Blen#1;diff_~D#1.base, diff_~D#1.offset := diff_#in~D#1.base, diff_#in~D#1.offset;diff_~k~0#1 := 0;diff_~i~0#1 := 0;diff_~l1~0#1 := diff_~Alen#1;diff_~l2~0#1 := diff_~Blen#1;havoc diff_~found~0#1;" "assume diff_~i~0#1 < diff_~l1~0#1;diff_~j~0#1 := 0;diff_~found~0#1 := 0;" "assume diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1;call diff_#t~mem2#1 := read~int#2(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call diff_#t~mem3#1 := read~int#0(diff_~B#1.base, diff_~B#1.offset + 4 * diff_~j~0#1, 4);" "assume !(diff_#t~mem2#1 == diff_#t~mem3#1);havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_#t~post4#1 := diff_~j~0#1;diff_~j~0#1 := 1 + diff_#t~post4#1;havoc diff_#t~post4#1;" "assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1);" "assume !(0 == diff_~found~0#1);" "diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_~j~0#1;havoc diff_#t~post7#1;" "assume diff_~i~0#1 < diff_~l1~0#1;diff_~j~0#1 := 0;diff_~found~0#1 := 0;" [2025-03-04 15:45:29,224 INFO L754 eck$LassoCheckResult]: Loop: "assume diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1;call diff_#t~mem2#1 := read~int#2(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call diff_#t~mem3#1 := read~int#0(diff_~B#1.base, diff_~B#1.offset + 4 * diff_~j~0#1, 4);" "assume !(diff_#t~mem2#1 == diff_#t~mem3#1);havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_#t~post4#1 := diff_~j~0#1;diff_~j~0#1 := 1 + diff_#t~post4#1;havoc diff_#t~post4#1;" [2025-03-04 15:45:29,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:29,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1641192956, now seen corresponding path program 1 times [2025-03-04 15:45:29,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:29,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549965577] [2025-03-04 15:45:29,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:29,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:29,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:45:29,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:45:29,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:29,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:29,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:45:29,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:45:29,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549965577] [2025-03-04 15:45:29,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549965577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:45:29,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:45:29,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:45:29,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978349087] [2025-03-04 15:45:29,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:45:29,256 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:45:29,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:29,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 2 times [2025-03-04 15:45:29,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:29,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717393796] [2025-03-04 15:45:29,256 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:45:29,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:29,258 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:29,259 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:29,259 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:45:29,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:29,259 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:29,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:29,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:29,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:29,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:29,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:29,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:45:29,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:45:29,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:45:29,317 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-04 15:45:29,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:45:29,327 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2025-03-04 15:45:29,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 34 transitions. [2025-03-04 15:45:29,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:29,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 34 transitions. [2025-03-04 15:45:29,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-04 15:45:29,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:45:29,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 34 transitions. [2025-03-04 15:45:29,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:29,328 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 34 transitions. [2025-03-04 15:45:29,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 34 transitions. [2025-03-04 15:45:29,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-04 15:45:29,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 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-04 15:45:29,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2025-03-04 15:45:29,329 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 34 transitions. [2025-03-04 15:45:29,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:45:29,329 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2025-03-04 15:45:29,329 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-04 15:45:29,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 34 transitions. [2025-03-04 15:45:29,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:29,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:29,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:29,330 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:45:29,330 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:29,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~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~i~1#1, main_#t~nondet15#1, main_#t~post16#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;havoc main_#t~nondet8#1;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;" "assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911);" "assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1 % 4294967296);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1 % 4294967296);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1 % 4294967296);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~Alen~0#1;havoc main_#t~nondet13#1;call write~int#2(main_#t~nondet13#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~i~1#1 < main_~Alen~0#1);havoc main_~i~1#1;main_~i~2#1 := 0;" "assume main_~i~2#1 < main_~Blen~0#1;havoc main_#t~nondet15#1;call write~int#0(main_#t~nondet15#1, main_~B~0#1.base, main_~B~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~nondet15#1;main_#t~post16#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1;" "assume !(main_~i~2#1 < main_~Blen~0#1);havoc main_~i~2#1;assume { :begin_inline_diff } true;diff_#in~A#1.base, diff_#in~A#1.offset, diff_#in~Alen#1, diff_#in~B#1.base, diff_#in~B#1.offset, diff_#in~Blen#1, diff_#in~D#1.base, diff_#in~D#1.offset := main_~A~0#1.base, main_~A~0#1.offset, main_~Alen~0#1, main_~B~0#1.base, main_~B~0#1.offset, main_~Blen~0#1, main_~D~0#1.base, main_~D~0#1.offset;havoc diff_#t~mem2#1, diff_#t~mem3#1, diff_#t~post4#1, diff_#t~mem5#1, diff_#t~post6#1, diff_#t~post7#1, diff_~j~0#1, diff_~A#1.base, diff_~A#1.offset, diff_~Alen#1, diff_~B#1.base, diff_~B#1.offset, diff_~Blen#1, diff_~D#1.base, diff_~D#1.offset, diff_~k~0#1, diff_~i~0#1, diff_~l1~0#1, diff_~l2~0#1, diff_~found~0#1;diff_~A#1.base, diff_~A#1.offset := diff_#in~A#1.base, diff_#in~A#1.offset;diff_~Alen#1 := diff_#in~Alen#1;diff_~B#1.base, diff_~B#1.offset := diff_#in~B#1.base, diff_#in~B#1.offset;diff_~Blen#1 := diff_#in~Blen#1;diff_~D#1.base, diff_~D#1.offset := diff_#in~D#1.base, diff_#in~D#1.offset;diff_~k~0#1 := 0;diff_~i~0#1 := 0;diff_~l1~0#1 := diff_~Alen#1;diff_~l2~0#1 := diff_~Blen#1;havoc diff_~found~0#1;" "assume diff_~i~0#1 < diff_~l1~0#1;diff_~j~0#1 := 0;diff_~found~0#1 := 0;" "assume diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1;call diff_#t~mem2#1 := read~int#2(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call diff_#t~mem3#1 := read~int#0(diff_~B#1.base, diff_~B#1.offset + 4 * diff_~j~0#1, 4);" "assume !(diff_#t~mem2#1 == diff_#t~mem3#1);havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_#t~post4#1 := diff_~j~0#1;diff_~j~0#1 := 1 + diff_#t~post4#1;havoc diff_#t~post4#1;" "assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1);" "assume 0 == diff_~found~0#1;call diff_#t~mem5#1 := read~int#2(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call write~int#1(diff_#t~mem5#1, diff_~D#1.base, diff_~D#1.offset + 4 * diff_~k~0#1, 4);havoc diff_#t~mem5#1;diff_#t~post6#1 := diff_~k~0#1;diff_~k~0#1 := 1 + diff_#t~post6#1;havoc diff_#t~post6#1;" "diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_~j~0#1;havoc diff_#t~post7#1;" "assume diff_~i~0#1 < diff_~l1~0#1;diff_~j~0#1 := 0;diff_~found~0#1 := 0;" [2025-03-04 15:45:29,330 INFO L754 eck$LassoCheckResult]: Loop: "assume diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1;call diff_#t~mem2#1 := read~int#2(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call diff_#t~mem3#1 := read~int#0(diff_~B#1.base, diff_~B#1.offset + 4 * diff_~j~0#1, 4);" "assume !(diff_#t~mem2#1 == diff_#t~mem3#1);havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_#t~post4#1 := diff_~j~0#1;diff_~j~0#1 := 1 + diff_#t~post4#1;havoc diff_#t~post4#1;" [2025-03-04 15:45:29,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:29,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1641191995, now seen corresponding path program 1 times [2025-03-04 15:45:29,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:29,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904203517] [2025-03-04 15:45:29,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:29,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:29,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:45:29,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:45:29,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:29,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:45:29,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:45:29,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904203517] [2025-03-04 15:45:29,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904203517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:45:29,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474035440] [2025-03-04 15:45:29,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:29,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:45:29,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:29,416 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:45:29,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2025-03-04 15:45:29,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:45:29,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:45:29,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:29,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:29,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:45:29,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:29,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:45:29,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:45:29,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:45:29,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474035440] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:45:29,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:45:29,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-04 15:45:29,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547127897] [2025-03-04 15:45:29,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:45:29,598 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:45:29,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:29,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 3 times [2025-03-04 15:45:29,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:29,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036546636] [2025-03-04 15:45:29,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:45:29,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:29,601 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:29,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:29,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:45:29,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:29,602 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:29,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:29,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:29,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:29,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:29,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:29,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:45:29,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:45:29,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:45:29,654 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. cyclomatic complexity: 15 Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:45:29,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:45:29,708 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2025-03-04 15:45:29,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 57 transitions. [2025-03-04 15:45:29,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:29,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 25 states and 34 transitions. [2025-03-04 15:45:29,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-04 15:45:29,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:45:29,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2025-03-04 15:45:29,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:29,712 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-03-04 15:45:29,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2025-03-04 15:45:29,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-04 15:45:29,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.36) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 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-04 15:45:29,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2025-03-04 15:45:29,713 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-03-04 15:45:29,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:45:29,714 INFO L432 stractBuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-03-04 15:45:29,715 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-04 15:45:29,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2025-03-04 15:45:29,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:29,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:29,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:29,716 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:45:29,716 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:29,716 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~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~i~1#1, main_#t~nondet15#1, main_#t~post16#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;havoc main_#t~nondet8#1;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;" "assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911);" "assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1 % 4294967296);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1 % 4294967296);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1 % 4294967296);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~Alen~0#1;havoc main_#t~nondet13#1;call write~int#2(main_#t~nondet13#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~i~1#1 < main_~Alen~0#1;havoc main_#t~nondet13#1;call write~int#2(main_#t~nondet13#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~i~1#1 < main_~Alen~0#1);havoc main_~i~1#1;main_~i~2#1 := 0;" "assume main_~i~2#1 < main_~Blen~0#1;havoc main_#t~nondet15#1;call write~int#0(main_#t~nondet15#1, main_~B~0#1.base, main_~B~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~nondet15#1;main_#t~post16#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1;" "assume !(main_~i~2#1 < main_~Blen~0#1);havoc main_~i~2#1;assume { :begin_inline_diff } true;diff_#in~A#1.base, diff_#in~A#1.offset, diff_#in~Alen#1, diff_#in~B#1.base, diff_#in~B#1.offset, diff_#in~Blen#1, diff_#in~D#1.base, diff_#in~D#1.offset := main_~A~0#1.base, main_~A~0#1.offset, main_~Alen~0#1, main_~B~0#1.base, main_~B~0#1.offset, main_~Blen~0#1, main_~D~0#1.base, main_~D~0#1.offset;havoc diff_#t~mem2#1, diff_#t~mem3#1, diff_#t~post4#1, diff_#t~mem5#1, diff_#t~post6#1, diff_#t~post7#1, diff_~j~0#1, diff_~A#1.base, diff_~A#1.offset, diff_~Alen#1, diff_~B#1.base, diff_~B#1.offset, diff_~Blen#1, diff_~D#1.base, diff_~D#1.offset, diff_~k~0#1, diff_~i~0#1, diff_~l1~0#1, diff_~l2~0#1, diff_~found~0#1;diff_~A#1.base, diff_~A#1.offset := diff_#in~A#1.base, diff_#in~A#1.offset;diff_~Alen#1 := diff_#in~Alen#1;diff_~B#1.base, diff_~B#1.offset := diff_#in~B#1.base, diff_#in~B#1.offset;diff_~Blen#1 := diff_#in~Blen#1;diff_~D#1.base, diff_~D#1.offset := diff_#in~D#1.base, diff_#in~D#1.offset;diff_~k~0#1 := 0;diff_~i~0#1 := 0;diff_~l1~0#1 := diff_~Alen#1;diff_~l2~0#1 := diff_~Blen#1;havoc diff_~found~0#1;" "assume diff_~i~0#1 < diff_~l1~0#1;diff_~j~0#1 := 0;diff_~found~0#1 := 0;" "assume diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1;call diff_#t~mem2#1 := read~int#2(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call diff_#t~mem3#1 := read~int#0(diff_~B#1.base, diff_~B#1.offset + 4 * diff_~j~0#1, 4);" "assume !(diff_#t~mem2#1 == diff_#t~mem3#1);havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_#t~post4#1 := diff_~j~0#1;diff_~j~0#1 := 1 + diff_#t~post4#1;havoc diff_#t~post4#1;" "assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1);" "assume 0 == diff_~found~0#1;call diff_#t~mem5#1 := read~int#2(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call write~int#1(diff_#t~mem5#1, diff_~D#1.base, diff_~D#1.offset + 4 * diff_~k~0#1, 4);havoc diff_#t~mem5#1;diff_#t~post6#1 := diff_~k~0#1;diff_~k~0#1 := 1 + diff_#t~post6#1;havoc diff_#t~post6#1;" "diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_~j~0#1;havoc diff_#t~post7#1;" "assume diff_~i~0#1 < diff_~l1~0#1;diff_~j~0#1 := 0;diff_~found~0#1 := 0;" [2025-03-04 15:45:29,716 INFO L754 eck$LassoCheckResult]: Loop: "assume diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1;call diff_#t~mem2#1 := read~int#2(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call diff_#t~mem3#1 := read~int#0(diff_~B#1.base, diff_~B#1.offset + 4 * diff_~j~0#1, 4);" "assume !(diff_#t~mem2#1 == diff_#t~mem3#1);havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_#t~post4#1 := diff_~j~0#1;diff_~j~0#1 := 1 + diff_#t~post4#1;havoc diff_#t~post4#1;" [2025-03-04 15:45:29,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:29,717 INFO L85 PathProgramCache]: Analyzing trace with hash 823984817, now seen corresponding path program 2 times [2025-03-04 15:45:29,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:29,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706763053] [2025-03-04 15:45:29,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:45:29,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:29,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 15:45:29,737 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:45:29,737 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:45:29,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:29,737 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:29,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:45:29,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:45:29,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:29,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:29,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:29,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:29,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 4 times [2025-03-04 15:45:29,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:29,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599449081] [2025-03-04 15:45:29,749 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:45:29,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:29,752 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-04 15:45:29,752 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:29,753 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:45:29,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:29,753 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:29,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:29,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:29,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:29,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:29,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:29,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:29,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1575426960, now seen corresponding path program 3 times [2025-03-04 15:45:29,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:29,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495581791] [2025-03-04 15:45:29,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:45:29,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:29,761 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-03-04 15:45:29,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:45:29,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 15:45:29,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:29,777 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:29,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:45:29,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:45:29,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:29,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:29,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:30,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-03-04 15:45:31,354 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:45:31,354 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:45:31,354 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:45:31,354 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:45:31,354 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:45:31,354 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:31,354 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:45:31,354 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:45:31,354 INFO L132 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration11_Lasso [2025-03-04 15:45:31,354 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:45:31,354 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:45:31,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:31,874 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:45:31,874 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:45:31,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:31,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:31,876 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-04 15:45:31,878 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-04 15:45:31,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:31,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:31,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:31,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:31,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:31,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:31,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:31,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:31,890 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:31,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:31,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:31,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:31,896 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-04 15:45:31,897 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-04 15:45:31,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:31,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:31,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:31,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:31,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:31,908 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:31,908 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:31,912 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:31,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-03-04 15:45:31,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:31,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:31,919 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-04 15:45:31,919 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-04 15:45:31,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:31,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:31,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:31,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:31,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:31,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:31,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:31,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:31,932 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:31,937 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-04 15:45:31,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:31,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:31,939 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-04 15:45:31,940 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-04 15:45:31,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:31,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:31,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:31,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:31,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:31,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:31,950 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:31,950 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:31,951 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:31,956 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-04 15:45:31,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:31,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:31,958 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-04 15:45:31,958 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-04 15:45:31,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:31,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:31,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:31,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:31,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:31,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:31,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:31,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:31,970 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:31,975 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-04 15:45:31,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:31,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:31,977 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-04 15:45:31,977 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-04 15:45:31,978 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:31,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:31,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:31,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:31,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:31,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:31,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:31,988 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:31,989 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:31,994 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-04 15:45:31,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:31,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:31,995 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-04 15:45:31,996 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-04 15:45:31,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:32,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:32,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:32,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:32,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:32,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:32,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:32,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:32,007 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:32,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-03-04 15:45:32,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:32,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:32,014 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-04 15:45:32,015 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-04 15:45:32,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:32,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:32,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:32,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:32,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:32,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:32,026 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:32,026 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:32,027 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:32,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-03-04 15:45:32,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:32,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:32,033 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-04 15:45:32,034 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-04 15:45:32,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:32,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:32,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:32,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:32,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:32,045 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:32,045 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:32,047 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:32,053 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-04 15:45:32,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:32,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:32,054 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-04 15:45:32,055 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-04 15:45:32,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:32,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:32,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:32,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:32,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:32,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:32,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:32,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:32,066 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:32,071 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-04 15:45:32,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:32,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:32,073 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-04 15:45:32,073 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-04 15:45:32,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-04 15:45:32,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:32,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:32,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:32,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:32,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:32,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:32,093 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:45:32,112 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2025-03-04 15:45:32,112 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-03-04 15:45:32,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:32,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:32,114 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-04 15:45:32,115 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-04 15:45:32,115 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:45:32,126 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:45:32,126 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:45:32,126 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~j~0#1, ULTIMATE.start_diff_~l2~0#1) = -1*ULTIMATE.start_diff_~j~0#1 + 1*ULTIMATE.start_diff_~l2~0#1 Supporting invariants [] [2025-03-04 15:45:32,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:32,159 INFO L156 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2025-03-04 15:45:32,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:32,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:45:32,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:45:32,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:32,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:32,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:45:32,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:32,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:32,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:32,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:32,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:32,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:45:32,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:32,212 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-04 15:45:32,212 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:45:32,212 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-04 15:45:32,226 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 14. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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 29 states and 40 transitions. Complement of second has 5 states. [2025-03-04 15:45:32,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:45:32,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-04 15:45:32,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2025-03-04 15:45:32,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 17 letters. Loop has 2 letters. [2025-03-04 15:45:32,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:32,227 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:32,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:32,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:45:32,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:45:32,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:32,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:32,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:45:32,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:32,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:32,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:32,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:32,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:32,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:45:32,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:32,287 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-04 15:45:32,287 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:45:32,287 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-04 15:45:32,302 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 14. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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 29 states and 40 transitions. Complement of second has 5 states. [2025-03-04 15:45:32,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:45:32,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-04 15:45:32,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2025-03-04 15:45:32,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 17 letters. Loop has 2 letters. [2025-03-04 15:45:32,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:32,303 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:32,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:32,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:45:32,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:45:32,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:32,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:32,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:45:32,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:32,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:32,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:32,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:32,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:32,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:45:32,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:32,362 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-04 15:45:32,362 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 2 loop predicates [2025-03-04 15:45:32,362 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-04 15:45:32,377 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 14. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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 31 states and 45 transitions. Complement of second has 4 states. [2025-03-04 15:45:32,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:45:32,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-04 15:45:32,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2025-03-04 15:45:32,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 17 letters. Loop has 2 letters. [2025-03-04 15:45:32,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:32,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 19 letters. Loop has 2 letters. [2025-03-04 15:45:32,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:32,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 17 letters. Loop has 4 letters. [2025-03-04 15:45:32,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:32,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 45 transitions. [2025-03-04 15:45:32,379 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:45:32,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2025-03-04 15:45:32,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:45:32,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:45:32,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:45:32,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:45:32,379 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:45:32,379 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:45:32,379 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:45:32,379 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-04 15:45:32,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 15:45:32,380 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:45:32,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 15:45:32,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:45:32 BoogieIcfgContainer [2025-03-04 15:45:32,385 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:45:32,385 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:45:32,385 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:45:32,385 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:45:32,385 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:45:21" (3/4) ... [2025-03-04 15:45:32,387 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 15:45:32,387 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:45:32,388 INFO L158 Benchmark]: Toolchain (without parser) took 11674.80ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 103.2MB in the beginning and 183.1MB in the end (delta: -79.9MB). Peak memory consumption was 94.6MB. Max. memory is 16.1GB. [2025-03-04 15:45:32,388 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:45:32,388 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.26ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 87.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:45:32,388 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.60ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 85.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:45:32,388 INFO L158 Benchmark]: Boogie Preprocessor took 26.34ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 83.9MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:45:32,388 INFO L158 Benchmark]: IcfgBuilder took 241.17ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 68.4MB in the end (delta: 15.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:45:32,388 INFO L158 Benchmark]: BuchiAutomizer took 11079.86ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 68.4MB in the beginning and 183.2MB in the end (delta: -114.9MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2025-03-04 15:45:32,389 INFO L158 Benchmark]: Witness Printer took 2.15ms. Allocated memory is still 310.4MB. Free memory was 183.2MB in the beginning and 183.1MB in the end (delta: 92.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:45:32,389 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.26ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 87.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.60ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 85.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.34ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 83.9MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 241.17ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 68.4MB in the end (delta: 15.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 11079.86ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 68.4MB in the beginning and 183.2MB in the end (delta: -114.9MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. * Witness Printer took 2.15ms. Allocated memory is still 310.4MB. Free memory was 183.2MB in the beginning and 183.1MB in the end (delta: 92.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (6 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (Alen + ((long long) -1 * i)) and consists of 2 locations. One deterministic module has affine ranking function null and consists of 3 locations. One deterministic module has affine ranking function (((long long) -1 * i) + l1) and consists of 3 locations. One deterministic module has affine ranking function (l2 + ((long long) -1 * j)) and consists of 3 locations. One nondeterministic module has affine ranking function (l2 + ((long long) -1 * j)) and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.0s and 12 iterations. TraceHistogramMax:2. Analysis of lassos took 10.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 5 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 116 mSDsluCounter, 316 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 142 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 166 IncrementalHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 174 mSDtfsCounter, 166 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU4 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital214 mio100 ax108 hnf100 lsp87 ukn71 mio100 lsp35 div151 bol100 ite100 ukn100 eq159 hnf92 smp84 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-04 15:45:32,400 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-04 15:45:32,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2025-03-04 15:45:32,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE