./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/b.11-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8ef6a70edb4426b11650a0154f4234f5ac775ab47d29a5a4fff3db3968295222 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:39:45,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:39:46,020 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-04 15:39:46,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:39:46,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:39:46,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:39:46,049 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:39:46,050 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:39:46,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:39:46,050 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:39:46,051 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:39:46,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:39:46,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:39:46,052 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:39:46,052 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:39:46,052 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:39:46,052 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:39:46,052 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:39:46,052 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:39:46,052 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:39:46,053 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:39:46,053 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:39:46,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:39:46,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:39:46,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:39:46,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:39:46,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:39:46,053 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:39:46,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:39:46,053 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:39:46,053 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:39:46,054 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:39:46,054 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:39:46,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:39:46,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:39:46,054 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:39:46,055 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:39:46,055 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8ef6a70edb4426b11650a0154f4234f5ac775ab47d29a5a4fff3db3968295222 [2025-03-04 15:39:46,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:39:46,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:39:46,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:39:46,319 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:39:46,319 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:39:46,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i [2025-03-04 15:39:47,496 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4572dcb45/83ae80df3c974ce78b28e880af5238f2/FLAG9c572fee5 [2025-03-04 15:39:47,731 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:39:47,732 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i [2025-03-04 15:39:47,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4572dcb45/83ae80df3c974ce78b28e880af5238f2/FLAG9c572fee5 [2025-03-04 15:39:47,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4572dcb45/83ae80df3c974ce78b28e880af5238f2 [2025-03-04 15:39:47,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:39:47,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:39:47,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:39:47,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:39:47,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:39:47,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:39:47" (1/1) ... [2025-03-04 15:39:47,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5803ec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:47, skipping insertion in model container [2025-03-04 15:39:47,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:39:47" (1/1) ... [2025-03-04 15:39:47,786 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:39:47,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:39:47,988 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:39:48,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:39:48,032 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:39:48,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:48 WrapperNode [2025-03-04 15:39:48,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:39:48,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:39:48,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:39:48,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:39:48,038 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:39:48" (1/1) ... [2025-03-04 15:39:48,046 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:39:48" (1/1) ... [2025-03-04 15:39:48,059 INFO L138 Inliner]: procedures = 111, calls = 34, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 113 [2025-03-04 15:39:48,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:39:48,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:39:48,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:39:48,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:39:48,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:48" (1/1) ... [2025-03-04 15:39:48,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:48" (1/1) ... [2025-03-04 15:39:48,069 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:48" (1/1) ... [2025-03-04 15:39:48,078 INFO L175 MemorySlicer]: Split 22 memory accesses to 3 slices as follows [12, 8, 2]. 55 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 6 writes are split as follows [3, 2, 1]. [2025-03-04 15:39:48,078 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:48" (1/1) ... [2025-03-04 15:39:48,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:48" (1/1) ... [2025-03-04 15:39:48,082 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:48" (1/1) ... [2025-03-04 15:39:48,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:48" (1/1) ... [2025-03-04 15:39:48,084 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:48" (1/1) ... [2025-03-04 15:39:48,084 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:48" (1/1) ... [2025-03-04 15:39:48,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:39:48,086 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:39:48,086 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:39:48,086 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:39:48,087 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:48" (1/1) ... [2025-03-04 15:39:48,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:48,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:48,109 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:39:48,111 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:39:48,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:39:48,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:39:48,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:39:48,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:39:48,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:39:48,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:39:48,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:39:48,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:39:48,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:39:48,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:39:48,209 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:39:48,210 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:39:48,342 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L569: havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;havoc main_#t~ret27#1; [2025-03-04 15:39:48,342 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L566: havoc test_fun_#t~mem24#1;call ULTIMATE.dealloc(test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset);havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset);havoc test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset);havoc test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset; [2025-03-04 15:39:48,353 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-04 15:39:48,353 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:39:48,358 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:39:48,360 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:39:48,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:39:48 BoogieIcfgContainer [2025-03-04 15:39:48,360 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:39:48,361 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:39:48,361 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:39:48,365 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:39:48,365 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:39:48,365 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:39:47" (1/3) ... [2025-03-04 15:39:48,367 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77855d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:39:48, skipping insertion in model container [2025-03-04 15:39:48,367 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:39:48,367 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:48" (2/3) ... [2025-03-04 15:39:48,367 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77855d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:39:48, skipping insertion in model container [2025-03-04 15:39:48,367 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:39:48,367 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:39:48" (3/3) ... [2025-03-04 15:39:48,369 INFO L363 chiAutomizerObserver]: Analyzing ICFG b.11-alloca.i [2025-03-04 15:39:48,406 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:39:48,406 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:39:48,406 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:39:48,406 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:39:48,406 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:39:48,407 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:39:48,407 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:39:48,408 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:39:48,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 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:39:48,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2025-03-04 15:39:48,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:48,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:48,429 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:39:48,429 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:39:48,429 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:39:48,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 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:39:48,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2025-03-04 15:39:48,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:48,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:48,430 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:39:48,430 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:39:48,436 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~nondet25#1, main_#t~nondet26#1, main_#t~ret27#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet25#1, main_#t~nondet26#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~short8#1, test_fun_#t~mem9#1, test_fun_#t~mem11#1, test_fun_#t~mem10#1, test_fun_#t~short12#1, test_fun_#t~short13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_#t~short16#1, test_fun_#t~mem17#1, test_fun_#t~mem18#1, test_fun_#t~mem19#1, test_fun_#t~mem20#1, test_fun_#t~mem21#1, test_fun_#t~mem22#1, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" [2025-03-04 15:39:48,436 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 >= 0;" "assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 2147483647 - test_fun_#t~mem6#1;" "test_fun_#t~short13#1 := test_fun_#t~short8#1;" "assume test_fun_#t~short13#1;" "test_fun_#t~short16#1 := test_fun_#t~short13#1;" "assume !test_fun_#t~short16#1;" "assume test_fun_#t~short16#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short8#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~short12#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~mem14#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~short16#1;call test_fun_#t~mem17#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem18#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume test_fun_#t~mem17#1 > test_fun_#t~mem18#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem18#1;call test_fun_#t~mem19#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem19#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem19#1;" [2025-03-04 15:39:48,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:48,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1888, now seen corresponding path program 1 times [2025-03-04 15:39:48,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:48,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065603537] [2025-03-04 15:39:48,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:48,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:48,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:39:48,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:39:48,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:48,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:48,534 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:48,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:39:48,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:39:48,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:48,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:48,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:48,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:48,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1060503350, now seen corresponding path program 1 times [2025-03-04 15:39:48,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:48,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212237044] [2025-03-04 15:39:48,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:48,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:48,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:39:48,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:39:48,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:48,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:48,655 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:39:48,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:39:48,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212237044] [2025-03-04 15:39:48,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212237044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:39:48,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:39:48,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:39:48,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335664759] [2025-03-04 15:39:48,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:39:48,659 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:39:48,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:39:48,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:39:48,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:39:48,676 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 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 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:48,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:39:48,707 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2025-03-04 15:39:48,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2025-03-04 15:39:48,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-03-04 15:39:48,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 21 transitions. [2025-03-04 15:39:48,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-03-04 15:39:48,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-03-04 15:39:48,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2025-03-04 15:39:48,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:39:48,716 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2025-03-04 15:39:48,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2025-03-04 15:39:48,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-04 15:39:48,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 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:39:48,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2025-03-04 15:39:48,733 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2025-03-04 15:39:48,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:39:48,736 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2025-03-04 15:39:48,736 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:39:48,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2025-03-04 15:39:48,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-03-04 15:39:48,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:48,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:48,739 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:39:48,739 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:39:48,739 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~nondet25#1, main_#t~nondet26#1, main_#t~ret27#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet25#1, main_#t~nondet26#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~short8#1, test_fun_#t~mem9#1, test_fun_#t~mem11#1, test_fun_#t~mem10#1, test_fun_#t~short12#1, test_fun_#t~short13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_#t~short16#1, test_fun_#t~mem17#1, test_fun_#t~mem18#1, test_fun_#t~mem19#1, test_fun_#t~mem20#1, test_fun_#t~mem21#1, test_fun_#t~mem22#1, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" [2025-03-04 15:39:48,739 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 >= 0;" "assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 2147483647 - test_fun_#t~mem6#1;" "test_fun_#t~short13#1 := test_fun_#t~short8#1;" "assume test_fun_#t~short13#1;" "test_fun_#t~short16#1 := test_fun_#t~short13#1;" "assume test_fun_#t~short16#1;call test_fun_#t~mem14#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short16#1 := test_fun_#t~mem14#1 + test_fun_#t~mem15#1 > 0;" "assume test_fun_#t~short16#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short8#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~short12#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~mem14#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~short16#1;call test_fun_#t~mem17#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem18#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume test_fun_#t~mem17#1 > test_fun_#t~mem18#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem18#1;call test_fun_#t~mem19#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem19#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem19#1;" [2025-03-04 15:39:48,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:48,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1888, now seen corresponding path program 2 times [2025-03-04 15:39:48,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:48,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119909110] [2025-03-04 15:39:48,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:39:48,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:48,754 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:39:48,771 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:39:48,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:39:48,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:48,772 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:48,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:39:48,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:39:48,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:48,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:48,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:48,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:48,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1060502389, now seen corresponding path program 1 times [2025-03-04 15:39:48,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:48,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808818507] [2025-03-04 15:39:48,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:48,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:48,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:39:48,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:39:48,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:48,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:48,809 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:48,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:39:48,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:39:48,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:48,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:48,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:48,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:48,830 INFO L85 PathProgramCache]: Analyzing trace with hash 597963732, now seen corresponding path program 1 times [2025-03-04 15:39:48,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:48,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915310344] [2025-03-04 15:39:48,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:48,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:48,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:39:48,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:39:48,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:48,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:48,880 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:48,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:39:48,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:39:48,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:48,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:48,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:49,521 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:39:49,522 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:39:49,522 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:39:49,523 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:39:49,523 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:39:49,523 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:49,523 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:39:49,523 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:39:49,524 INFO L132 ssoRankerPreferences]: Filename of dumped script: b.11-alloca.i_Iteration2_Lasso [2025-03-04 15:39:49,524 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:39:49,524 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:39:49,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:50,174 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:39:50,179 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:39:50,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:50,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:50,182 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:39:50,185 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:39:50,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:39:50,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:50,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:50,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:50,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:50,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:50,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:50,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:50,206 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:50,213 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:39:50,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:50,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:50,215 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:39:50,217 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:39:50,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:50,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:50,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:50,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:50,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:50,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:50,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:50,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:50,231 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:50,237 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:39:50,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:50,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:50,240 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:39:50,241 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:39:50,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:50,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:50,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:50,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:50,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:50,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:50,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:50,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:50,255 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:50,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-04 15:39:50,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:50,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:50,262 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:39:50,264 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:39:50,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:50,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:50,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:50,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:50,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:50,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:50,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:50,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:50,278 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:50,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:50,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:50,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:50,288 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:39:50,288 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:39:50,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:39:50,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:50,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:50,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:50,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:50,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:50,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:50,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:50,301 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:50,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-04 15:39:50,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:50,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:50,311 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:39:50,313 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:39:50,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:39:50,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:50,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:50,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:50,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:50,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:50,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:50,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:50,327 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:50,334 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:39:50,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:50,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:50,338 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:39:50,340 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:39:50,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:39:50,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:50,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:50,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:50,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:50,359 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:50,359 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:50,365 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:39:50,377 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-04 15:39:50,382 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-04 15:39:50,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:50,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:50,388 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:39:50,396 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:39:50,397 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:39:50,412 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:39:50,412 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:39:50,413 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_1 Supporting invariants [] [2025-03-04 15:39:50,421 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:39:50,482 INFO L156 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2025-03-04 15:39:50,487 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:39:50,487 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:39:50,487 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2025-03-04 15:39:50,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:50,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:39:50,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:39:50,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:50,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:50,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:39:50,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:50,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:39:50,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:39:50,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:50,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:50,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 15:39:50,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:50,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-03-04 15:39:50,724 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:39:50,726 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:39:50,727 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 7 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:50,850 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 7. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 45 transitions. Complement of second has 8 states. [2025-03-04 15:39:50,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 15:39:50,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:50,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2025-03-04 15:39:50,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2025-03-04 15:39:50,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:50,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2025-03-04 15:39:50,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:50,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2025-03-04 15:39:50,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:50,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 45 transitions. [2025-03-04 15:39:50,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-03-04 15:39:50,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 45 transitions. [2025-03-04 15:39:50,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-03-04 15:39:50,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-03-04 15:39:50,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 45 transitions. [2025-03-04 15:39:50,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:39:50,861 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 45 transitions. [2025-03-04 15:39:50,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 45 transitions. [2025-03-04 15:39:50,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2025-03-04 15:39:50,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 29 states have internal predecessors, (43), 0 states have call successors, (0), 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:39:50,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2025-03-04 15:39:50,863 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 43 transitions. [2025-03-04 15:39:50,863 INFO L432 stractBuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2025-03-04 15:39:50,863 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:39:50,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 43 transitions. [2025-03-04 15:39:50,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-03-04 15:39:50,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:50,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:50,864 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 15:39:50,864 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:39:50,864 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~nondet25#1, main_#t~nondet26#1, main_#t~ret27#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet25#1, main_#t~nondet26#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~short8#1, test_fun_#t~mem9#1, test_fun_#t~mem11#1, test_fun_#t~mem10#1, test_fun_#t~short12#1, test_fun_#t~short13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_#t~short16#1, test_fun_#t~mem17#1, test_fun_#t~mem18#1, test_fun_#t~mem19#1, test_fun_#t~mem20#1, test_fun_#t~mem21#1, test_fun_#t~mem22#1, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" "assume true;call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 >= 0;" [2025-03-04 15:39:50,864 INFO L754 eck$LassoCheckResult]: Loop: "assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 2147483647 - test_fun_#t~mem6#1;" "test_fun_#t~short13#1 := test_fun_#t~short8#1;" "assume test_fun_#t~short13#1;" "test_fun_#t~short16#1 := test_fun_#t~short13#1;" "assume test_fun_#t~short16#1;call test_fun_#t~mem14#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short16#1 := test_fun_#t~mem14#1 + test_fun_#t~mem15#1 > 0;" "assume test_fun_#t~short16#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short8#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~short12#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~mem14#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~short16#1;call test_fun_#t~mem17#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem18#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem17#1 > test_fun_#t~mem18#1);havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem18#1;call test_fun_#t~mem20#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem21#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume test_fun_#t~mem20#1 == test_fun_#t~mem21#1;havoc test_fun_#t~mem20#1;havoc test_fun_#t~mem21#1;call test_fun_#t~mem22#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem22#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem22#1;" "assume true;call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 >= 0;" [2025-03-04 15:39:50,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:50,864 INFO L85 PathProgramCache]: Analyzing trace with hash 58554, now seen corresponding path program 1 times [2025-03-04 15:39:50,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:50,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521550019] [2025-03-04 15:39:50,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:50,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:50,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:39:50,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:50,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:50,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:50,885 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:50,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:39:50,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:50,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:50,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:50,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:50,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:50,909 INFO L85 PathProgramCache]: Analyzing trace with hash -644595774, now seen corresponding path program 1 times [2025-03-04 15:39:50,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:50,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765970411] [2025-03-04 15:39:50,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:50,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:50,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:39:50,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:39:50,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:50,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:50,924 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:50,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:39:50,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:39:50,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:50,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:50,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:50,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:50,939 INFO L85 PathProgramCache]: Analyzing trace with hash -882468055, now seen corresponding path program 1 times [2025-03-04 15:39:50,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:50,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066673567] [2025-03-04 15:39:50,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:50,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:50,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:39:50,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:39:50,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:50,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:50,965 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:50,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:39:50,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:39:50,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:50,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:50,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:51,590 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:39:51,590 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:39:51,590 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:39:51,591 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:39:51,594 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:39:51,594 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:51,595 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:39:51,595 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:39:51,595 INFO L132 ssoRankerPreferences]: Filename of dumped script: b.11-alloca.i_Iteration3_Lasso [2025-03-04 15:39:51,595 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:39:51,595 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:39:51,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:52,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:52,303 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:39:52,304 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:39:52,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,308 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:39:52,309 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:39:52,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:39:52,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:52,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:52,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:52,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:52,327 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:52,328 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:52,334 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:52,344 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:39:52,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,346 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:39:52,348 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:39:52,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:39:52,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:52,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:52,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:52,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:52,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:52,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:52,368 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:52,375 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:39:52,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,377 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:39:52,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-04 15:39:52,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:39:52,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:52,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:52,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:52,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:52,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:52,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:52,396 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:52,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:52,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,403 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:39:52,405 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:39:52,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:39:52,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:52,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:52,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:52,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:52,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:52,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:52,425 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:52,431 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:39:52,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,435 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:39:52,437 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:39:52,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:39:52,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:52,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:52,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:52,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:52,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:52,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:52,455 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:52,462 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:39:52,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,465 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:39:52,465 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:39:52,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:52,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:52,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:52,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:52,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:52,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:52,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:52,489 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:52,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:52,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,497 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:39:52,499 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:39:52,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:52,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:52,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:52,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:52,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:52,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:52,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:52,519 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:52,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:52,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,527 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:39:52,530 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:39:52,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:52,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:52,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:52,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:52,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:52,544 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:52,544 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:52,548 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:52,555 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:39:52,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,558 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:39:52,559 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:39:52,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:39:52,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:52,571 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-04 15:39:52,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:52,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:52,576 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-04 15:39:52,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:52,586 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:39:52,607 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-04 15:39:52,607 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2025-03-04 15:39:52,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,609 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:39:52,611 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:39:52,612 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:39:52,623 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:39:52,623 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:39:52,623 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_2) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_2 Supporting invariants [] [2025-03-04 15:39:52,629 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:39:52,676 INFO L156 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2025-03-04 15:39:52,678 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:39:52,678 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:39:52,678 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2025-03-04 15:39:52,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:52,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:39:52,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:52,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:52,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:52,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:39:52,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:52,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:39:52,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:39:52,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:52,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:52,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:39:52,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:52,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-03-04 15:39:52,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2025-03-04 15:39:52,833 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:39:52,834 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-03-04 15:39:52,834 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 43 transitions. cyclomatic complexity: 15 Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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:39:52,899 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 43 transitions. cyclomatic complexity: 15. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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 64 states and 97 transitions. Complement of second has 10 states. [2025-03-04 15:39:52,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-03-04 15:39:52,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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:39:52,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2025-03-04 15:39:52,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 3 letters. Loop has 9 letters. [2025-03-04 15:39:52,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:52,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 12 letters. Loop has 9 letters. [2025-03-04 15:39:52,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:52,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 3 letters. Loop has 18 letters. [2025-03-04 15:39:52,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:52,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 97 transitions. [2025-03-04 15:39:52,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-03-04 15:39:52,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 97 transitions. [2025-03-04 15:39:52,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-03-04 15:39:52,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-03-04 15:39:52,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 97 transitions. [2025-03-04 15:39:52,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:39:52,903 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 97 transitions. [2025-03-04 15:39:52,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 97 transitions. [2025-03-04 15:39:52,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2025-03-04 15:39:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.5161290322580645) internal successors, (94), 61 states have internal predecessors, (94), 0 states have call successors, (0), 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:39:52,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 94 transitions. [2025-03-04 15:39:52,906 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 94 transitions. [2025-03-04 15:39:52,906 INFO L432 stractBuchiCegarLoop]: Abstraction has 62 states and 94 transitions. [2025-03-04 15:39:52,906 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:39:52,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 94 transitions. [2025-03-04 15:39:52,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-03-04 15:39:52,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:52,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:52,907 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:39:52,907 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:39:52,908 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~nondet25#1, main_#t~nondet26#1, main_#t~ret27#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet25#1, main_#t~nondet26#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~short8#1, test_fun_#t~mem9#1, test_fun_#t~mem11#1, test_fun_#t~mem10#1, test_fun_#t~short12#1, test_fun_#t~short13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_#t~short16#1, test_fun_#t~mem17#1, test_fun_#t~mem18#1, test_fun_#t~mem19#1, test_fun_#t~mem20#1, test_fun_#t~mem21#1, test_fun_#t~mem22#1, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" "assume true;call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 >= 0;" "assume !test_fun_#t~short8#1;" [2025-03-04 15:39:52,908 INFO L754 eck$LassoCheckResult]: Loop: "test_fun_#t~short13#1 := test_fun_#t~short8#1;" "assume test_fun_#t~short13#1;" "test_fun_#t~short16#1 := test_fun_#t~short13#1;" "assume test_fun_#t~short16#1;call test_fun_#t~mem14#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short16#1 := test_fun_#t~mem14#1 + test_fun_#t~mem15#1 > 0;" "assume test_fun_#t~short16#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short8#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~short12#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~mem14#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~short16#1;call test_fun_#t~mem17#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem18#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem17#1 > test_fun_#t~mem18#1);havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem18#1;call test_fun_#t~mem20#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem21#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem20#1 == test_fun_#t~mem21#1);havoc test_fun_#t~mem20#1;havoc test_fun_#t~mem21#1;call test_fun_#t~mem23#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem23#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;" "assume true;call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 >= 0;" "assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 2147483647 - test_fun_#t~mem6#1;" [2025-03-04 15:39:52,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:52,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1815199, now seen corresponding path program 1 times [2025-03-04 15:39:52,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:52,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236428543] [2025-03-04 15:39:52,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:52,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:52,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:39:52,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:39:52,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:52,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:52,923 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:52,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:39:52,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:39:52,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:52,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:52,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:52,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:52,930 INFO L85 PathProgramCache]: Analyzing trace with hash -780804147, now seen corresponding path program 1 times [2025-03-04 15:39:52,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:52,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628833895] [2025-03-04 15:39:52,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:52,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:52,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:39:52,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:39:52,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:52,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:52,937 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:52,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:39:52,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:39:52,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:52,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:52,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:52,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:52,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1783218449, now seen corresponding path program 1 times [2025-03-04 15:39:52,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:52,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955509746] [2025-03-04 15:39:52,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:52,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:52,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:39:52,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:39:52,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:52,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:53,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:39:53,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:39:53,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955509746] [2025-03-04 15:39:53,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955509746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:39:53,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:39:53,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:39:53,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444962014] [2025-03-04 15:39:53,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:39:53,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:39:53,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:39:53,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:39:53,197 INFO L87 Difference]: Start difference. First operand 62 states and 94 transitions. cyclomatic complexity: 36 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:39:53,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:39:53,221 INFO L93 Difference]: Finished difference Result 70 states and 102 transitions. [2025-03-04 15:39:53,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 102 transitions. [2025-03-04 15:39:53,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2025-03-04 15:39:53,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 102 transitions. [2025-03-04 15:39:53,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-03-04 15:39:53,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-03-04 15:39:53,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 102 transitions. [2025-03-04 15:39:53,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:39:53,223 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 102 transitions. [2025-03-04 15:39:53,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 102 transitions. [2025-03-04 15:39:53,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-04 15:39:53,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.457142857142857) internal successors, (102), 69 states have internal predecessors, (102), 0 states have call successors, (0), 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:39:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions. [2025-03-04 15:39:53,227 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70 states and 102 transitions. [2025-03-04 15:39:53,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:39:53,228 INFO L432 stractBuchiCegarLoop]: Abstraction has 70 states and 102 transitions. [2025-03-04 15:39:53,229 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:39:53,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 102 transitions. [2025-03-04 15:39:53,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2025-03-04 15:39:53,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:53,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:53,230 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:39:53,230 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:39:53,230 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~nondet25#1, main_#t~nondet26#1, main_#t~ret27#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet25#1, main_#t~nondet26#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~short8#1, test_fun_#t~mem9#1, test_fun_#t~mem11#1, test_fun_#t~mem10#1, test_fun_#t~short12#1, test_fun_#t~short13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_#t~short16#1, test_fun_#t~mem17#1, test_fun_#t~mem18#1, test_fun_#t~mem19#1, test_fun_#t~mem20#1, test_fun_#t~mem21#1, test_fun_#t~mem22#1, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" "assume true;call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 >= 0;" "assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 2147483647 - test_fun_#t~mem6#1;" [2025-03-04 15:39:53,230 INFO L754 eck$LassoCheckResult]: Loop: "test_fun_#t~short13#1 := test_fun_#t~short8#1;" "assume test_fun_#t~short13#1;" "test_fun_#t~short16#1 := test_fun_#t~short13#1;" "assume test_fun_#t~short16#1;call test_fun_#t~mem14#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short16#1 := test_fun_#t~mem14#1 + test_fun_#t~mem15#1 > 0;" "assume test_fun_#t~short16#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short8#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~short12#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~mem14#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~short16#1;call test_fun_#t~mem17#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem18#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem17#1 > test_fun_#t~mem18#1);havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem18#1;call test_fun_#t~mem20#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem21#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem20#1 == test_fun_#t~mem21#1);havoc test_fun_#t~mem20#1;havoc test_fun_#t~mem21#1;call test_fun_#t~mem23#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem23#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;" "assume true;call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 >= 0;" "assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 2147483647 - test_fun_#t~mem6#1;" [2025-03-04 15:39:53,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:53,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1815198, now seen corresponding path program 1 times [2025-03-04 15:39:53,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:53,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694740947] [2025-03-04 15:39:53,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:53,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:53,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:39:53,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:39:53,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:53,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:53,239 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:53,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:39:53,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:39:53,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:53,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:53,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:53,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:53,246 INFO L85 PathProgramCache]: Analyzing trace with hash -780804147, now seen corresponding path program 2 times [2025-03-04 15:39:53,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:53,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830955653] [2025-03-04 15:39:53,246 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:39:53,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:53,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:39:53,252 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:39:53,252 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:39:53,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:53,252 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:53,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:39:53,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:39:53,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:53,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:53,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:53,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:53,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1586704944, now seen corresponding path program 1 times [2025-03-04 15:39:53,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:53,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764366401] [2025-03-04 15:39:53,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:53,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:53,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:39:53,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:39:53,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:53,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:53,283 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:53,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:39:53,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:39:53,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:53,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:53,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:53,974 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:39:53,974 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:39:53,975 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:39:53,975 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:39:53,975 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:39:53,975 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:53,975 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:39:53,975 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:39:53,975 INFO L132 ssoRankerPreferences]: Filename of dumped script: b.11-alloca.i_Iteration5_Lasso [2025-03-04 15:39:53,975 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:39:53,975 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:39:53,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,014 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:39:54,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:54,715 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:39:54,715 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:39:54,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:54,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:54,717 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:39:54,718 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:39:54,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:39:54,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:54,731 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:54,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:54,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:54,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:54,732 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:54,732 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:54,732 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:54,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-04 15:39:54,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:54,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:54,740 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:39:54,741 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:39:54,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:39:54,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:54,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:54,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:54,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:54,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:54,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:54,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:54,752 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:54,758 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:39:54,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:54,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:54,760 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:39:54,760 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:39:54,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:39:54,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:54,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:54,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:54,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:54,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:54,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:54,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:54,775 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:54,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-04 15:39:54,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:54,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:54,784 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:39:54,785 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:39:54,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:54,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:54,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:54,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:54,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:54,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:54,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:54,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:54,798 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:54,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:54,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:54,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:54,805 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:39:54,806 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:39:54,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:39:54,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:54,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:54,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:54,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:54,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:54,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:54,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:54,818 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:54,823 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:39:54,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:54,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:54,825 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:39:54,826 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:39:54,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:39:54,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:54,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:54,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:54,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:54,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:54,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:54,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:54,838 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:54,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-04 15:39:54,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:54,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:54,845 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:39:54,845 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:39:54,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:39:54,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:54,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:54,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:54,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:54,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:54,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:54,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:54,858 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:54,863 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:39:54,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:54,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:54,865 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:39:54,866 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:39:54,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:54,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:54,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:54,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:54,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:54,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:54,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:54,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:54,878 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:54,883 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:39:54,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:54,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:54,885 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:39:54,885 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:39:54,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:39:54,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:54,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:54,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:54,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:54,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:54,896 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:54,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:54,897 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:54,902 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:39:54,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:54,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:54,904 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:39:54,905 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:39:54,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:39:54,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:54,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:54,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:54,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:54,916 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:54,916 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:54,918 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:54,924 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:39:54,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:54,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:54,926 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:39:54,927 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:39:54,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:39:54,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:54,937 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:54,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:54,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:54,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:54,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:54,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:54,939 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:54,944 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:39:54,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:54,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:54,946 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:39:54,946 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:39:54,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:39:54,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:54,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:54,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:54,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:54,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:54,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:54,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:54,962 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:54,969 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:39:54,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:54,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:54,971 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:39:54,973 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:39:54,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:54,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:54,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:54,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:54,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:54,987 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:54,987 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:54,992 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:54,998 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:39:54,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:54,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:55,000 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:39:55,002 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:39:55,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:39:55,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:55,014 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-04 15:39:55,014 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:39:55,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:55,027 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-03-04 15:39:55,027 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-04 15:39:55,055 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:39:55,084 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-04 15:39:55,084 INFO L444 ModelExtractionUtils]: 18 out of 31 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-03-04 15:39:55,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:55,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:55,086 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:39:55,088 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:39:55,089 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:39:55,102 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-03-04 15:39:55,102 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:39:55,102 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) 0)_2) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) 0)_2 Supporting invariants [] [2025-03-04 15:39:55,111 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:39:55,149 INFO L156 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2025-03-04 15:39:55,150 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 15:39:55,151 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 15:39:55,151 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2025-03-04 15:39:55,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:55,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:39:55,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:39:55,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:55,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:55,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:39:55,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:55,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:39:55,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:39:55,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:55,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:55,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:39:55,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:55,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2025-03-04 15:39:55,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2025-03-04 15:39:55,385 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:39:55,385 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2025-03-04 15:39:55,385 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 102 transitions. cyclomatic complexity: 36 Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 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:39:55,497 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 102 transitions. cyclomatic complexity: 36. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 204 states and 297 transitions. Complement of second has 11 states. [2025-03-04 15:39:55,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2025-03-04 15:39:55,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 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:39:55,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2025-03-04 15:39:55,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 4 letters. Loop has 9 letters. [2025-03-04 15:39:55,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:55,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 13 letters. Loop has 9 letters. [2025-03-04 15:39:55,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:55,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 4 letters. Loop has 18 letters. [2025-03-04 15:39:55,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:55,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 204 states and 297 transitions. [2025-03-04 15:39:55,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2025-03-04 15:39:55,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 204 states to 54 states and 73 transitions. [2025-03-04 15:39:55,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-03-04 15:39:55,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-03-04 15:39:55,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 73 transitions. [2025-03-04 15:39:55,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:39:55,506 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 73 transitions. [2025-03-04 15:39:55,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 73 transitions. [2025-03-04 15:39:55,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-04 15:39:55,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 53 states have internal predecessors, (73), 0 states have call successors, (0), 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:39:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2025-03-04 15:39:55,508 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 73 transitions. [2025-03-04 15:39:55,508 INFO L432 stractBuchiCegarLoop]: Abstraction has 54 states and 73 transitions. [2025-03-04 15:39:55,508 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:39:55,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 73 transitions. [2025-03-04 15:39:55,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2025-03-04 15:39:55,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:55,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:55,509 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:39:55,509 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:39:55,509 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~nondet25#1, main_#t~nondet26#1, main_#t~ret27#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet25#1, main_#t~nondet26#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~short8#1, test_fun_#t~mem9#1, test_fun_#t~mem11#1, test_fun_#t~mem10#1, test_fun_#t~short12#1, test_fun_#t~short13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_#t~short16#1, test_fun_#t~mem17#1, test_fun_#t~mem18#1, test_fun_#t~mem19#1, test_fun_#t~mem20#1, test_fun_#t~mem21#1, test_fun_#t~mem22#1, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" "assume true;call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 >= 0;" "assume !test_fun_#t~short8#1;" [2025-03-04 15:39:55,509 INFO L754 eck$LassoCheckResult]: Loop: "test_fun_#t~short13#1 := test_fun_#t~short8#1;" "assume !test_fun_#t~short13#1;call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short12#1 := test_fun_#t~mem9#1 < 0;" "assume test_fun_#t~short12#1;call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short12#1 := test_fun_#t~mem11#1 > -2147483648 - test_fun_#t~mem10#1;" "test_fun_#t~short13#1 := test_fun_#t~short12#1;" "test_fun_#t~short16#1 := test_fun_#t~short13#1;" "assume !test_fun_#t~short16#1;" "assume test_fun_#t~short16#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short8#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~short12#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~mem14#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~short16#1;call test_fun_#t~mem17#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem18#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem17#1 > test_fun_#t~mem18#1);havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem18#1;call test_fun_#t~mem20#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem21#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem20#1 == test_fun_#t~mem21#1);havoc test_fun_#t~mem20#1;havoc test_fun_#t~mem21#1;call test_fun_#t~mem23#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem23#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;" "assume true;call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 >= 0;" "assume !test_fun_#t~short8#1;" [2025-03-04 15:39:55,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:55,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1815199, now seen corresponding path program 2 times [2025-03-04 15:39:55,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:55,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051680994] [2025-03-04 15:39:55,510 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:39:55,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:55,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:39:55,521 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:39:55,521 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:39:55,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:55,521 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:55,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:39:55,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:39:55,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:55,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:55,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:55,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:55,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1619973135, now seen corresponding path program 1 times [2025-03-04 15:39:55,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:55,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340671293] [2025-03-04 15:39:55,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:55,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:55,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:39:55,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:39:55,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:55,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:55,547 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:39:55,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:39:55,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340671293] [2025-03-04 15:39:55,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340671293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:39:55,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:39:55,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:39:55,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314756902] [2025-03-04 15:39:55,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:39:55,549 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:39:55,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:39:55,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:39:55,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:39:55,549 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. cyclomatic complexity: 23 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:55,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:39:55,557 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2025-03-04 15:39:55,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 73 transitions. [2025-03-04 15:39:55,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2025-03-04 15:39:55,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 54 states and 69 transitions. [2025-03-04 15:39:55,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-03-04 15:39:55,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-03-04 15:39:55,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 69 transitions. [2025-03-04 15:39:55,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:39:55,558 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 69 transitions. [2025-03-04 15:39:55,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 69 transitions. [2025-03-04 15:39:55,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-04 15:39:55,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 53 states have internal predecessors, (69), 0 states have call successors, (0), 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:39:55,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2025-03-04 15:39:55,563 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 69 transitions. [2025-03-04 15:39:55,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:39:55,565 INFO L432 stractBuchiCegarLoop]: Abstraction has 54 states and 69 transitions. [2025-03-04 15:39:55,565 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 15:39:55,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 69 transitions. [2025-03-04 15:39:55,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2025-03-04 15:39:55,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:55,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:55,566 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:39:55,566 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:39:55,566 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~nondet25#1, main_#t~nondet26#1, main_#t~ret27#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet25#1, main_#t~nondet26#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~short8#1, test_fun_#t~mem9#1, test_fun_#t~mem11#1, test_fun_#t~mem10#1, test_fun_#t~short12#1, test_fun_#t~short13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_#t~short16#1, test_fun_#t~mem17#1, test_fun_#t~mem18#1, test_fun_#t~mem19#1, test_fun_#t~mem20#1, test_fun_#t~mem21#1, test_fun_#t~mem22#1, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" "assume true;call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 >= 0;" "assume !test_fun_#t~short8#1;" [2025-03-04 15:39:55,566 INFO L754 eck$LassoCheckResult]: Loop: "test_fun_#t~short13#1 := test_fun_#t~short8#1;" "assume !test_fun_#t~short13#1;call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short12#1 := test_fun_#t~mem9#1 < 0;" "assume test_fun_#t~short12#1;call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short12#1 := test_fun_#t~mem11#1 > -2147483648 - test_fun_#t~mem10#1;" "test_fun_#t~short13#1 := test_fun_#t~short12#1;" "test_fun_#t~short16#1 := test_fun_#t~short13#1;" "assume test_fun_#t~short16#1;call test_fun_#t~mem14#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short16#1 := test_fun_#t~mem14#1 + test_fun_#t~mem15#1 > 0;" "assume test_fun_#t~short16#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short8#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~short12#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~mem14#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~short16#1;call test_fun_#t~mem17#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem18#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem17#1 > test_fun_#t~mem18#1);havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem18#1;call test_fun_#t~mem20#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem21#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem20#1 == test_fun_#t~mem21#1);havoc test_fun_#t~mem20#1;havoc test_fun_#t~mem21#1;call test_fun_#t~mem23#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem23#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;" "assume true;call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 >= 0;" "assume !test_fun_#t~short8#1;" [2025-03-04 15:39:55,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:55,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1815199, now seen corresponding path program 3 times [2025-03-04 15:39:55,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:55,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236992571] [2025-03-04 15:39:55,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:39:55,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:55,573 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:39:55,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:39:55,580 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:39:55,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:55,580 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:55,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:39:55,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:39:55,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:55,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:55,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:55,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:55,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1591343984, now seen corresponding path program 1 times [2025-03-04 15:39:55,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:55,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744625833] [2025-03-04 15:39:55,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:55,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:55,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:39:55,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:39:55,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:55,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:55,603 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:55,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:39:55,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:39:55,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:55,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:55,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:55,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:55,612 INFO L85 PathProgramCache]: Analyzing trace with hash 343874066, now seen corresponding path program 1 times [2025-03-04 15:39:55,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:55,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392547580] [2025-03-04 15:39:55,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:55,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:55,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:39:55,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:39:55,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:55,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:55,630 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:55,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:39:55,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:39:55,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:55,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:55,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:55,723 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:39:56,196 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:39:56,196 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:39:56,196 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:39:56,196 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:39:56,196 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:39:56,196 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:56,196 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:39:56,196 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:39:56,196 INFO L132 ssoRankerPreferences]: Filename of dumped script: b.11-alloca.i_Iteration7_Lasso [2025-03-04 15:39:56,196 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:39:56,196 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:39:56,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:56,641 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:39:56,641 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:39:56,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:56,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:56,643 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:39:56,644 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:39:56,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:39:56,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:56,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:56,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:56,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:56,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:56,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:56,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:56,656 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:56,661 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:39:56,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:56,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:56,663 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:39:56,664 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:39:56,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:39:56,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:56,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:56,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:56,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:56,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:56,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:56,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:56,675 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:56,681 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:39:56,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:56,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:56,683 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:39:56,684 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:39:56,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:39:56,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:56,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:56,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:56,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:56,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:56,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:56,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:56,696 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:56,701 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:39:56,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:56,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:56,703 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:39:56,703 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:39:56,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:56,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:56,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:56,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:56,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:56,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:56,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:56,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:56,717 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:56,724 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:39:56,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:56,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:56,726 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:39:56,726 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:39:56,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:39:56,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:56,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:56,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:56,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:56,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:56,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:56,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:56,739 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:56,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:56,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:56,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:56,746 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:39:56,747 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:39:56,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:39:56,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:56,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:56,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:56,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:56,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:56,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:56,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:56,758 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:56,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-03-04 15:39:56,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:56,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:56,767 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:39:56,768 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:39:56,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:39:56,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:56,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:56,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:56,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:56,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:56,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:56,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:56,783 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:56,789 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:39:56,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:56,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:56,791 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:39:56,792 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:39:56,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:39:56,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:56,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:56,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:56,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:56,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:56,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:56,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:56,809 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:56,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-03-04 15:39:56,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:56,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:56,816 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:39:56,817 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:39:56,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:56,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:56,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:56,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:56,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:56,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:56,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:56,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:56,829 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:56,834 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:39:56,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:56,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:56,837 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:39:56,838 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:39:56,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:56,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:56,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:56,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:56,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:56,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:56,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:56,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:56,850 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:56,856 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:39:56,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:56,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:56,858 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:39:56,859 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:39:56,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:39:56,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:56,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:56,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:56,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:56,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:56,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:56,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:56,870 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:56,875 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:39:56,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:56,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:56,877 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:39:56,878 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:39:56,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:39:56,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:56,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:56,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:56,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:56,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:56,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:56,893 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:56,898 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:39:56,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:56,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:56,900 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:39:56,901 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:39:56,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:56,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:56,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:56,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:56,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:56,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:56,913 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:56,913 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:56,914 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:56,920 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:39:56,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:56,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:56,922 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:39:56,922 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:39:56,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:56,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:56,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:56,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:56,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:56,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:56,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:56,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:56,935 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:56,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-03-04 15:39:56,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:56,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:56,943 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:39:56,943 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:39:56,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:56,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:56,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:56,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:56,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:56,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:56,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:56,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:56,956 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:56,961 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:39:56,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:56,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:56,963 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:39:56,963 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:39:56,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:56,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:56,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:56,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:56,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:56,975 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:56,975 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:56,978 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:56,984 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:39:56,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:56,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:56,985 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:39:56,986 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:39:56,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:39:56,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:56,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:56,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:56,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:57,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:57,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:57,004 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:57,009 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:39:57,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:57,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:57,011 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:39:57,012 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:39:57,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:57,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:57,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:57,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:57,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:57,025 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:57,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:57,030 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:39:57,043 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-04 15:39:57,043 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-04 15:39:57,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:57,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:57,045 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:39:57,046 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:39:57,046 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:39:57,058 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:39:57,058 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:39:57,058 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) 0)_3) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) 0)_3 Supporting invariants [] [2025-03-04 15:39:57,063 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:39:57,085 INFO L156 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2025-03-04 15:39:57,086 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 15:39:57,086 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 15:39:57,086 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2025-03-04 15:39:57,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:57,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:39:57,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:39:57,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:57,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:57,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:39:57,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:57,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:39:57,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:39:57,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:57,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:57,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 15:39:57,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:57,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 15:39:57,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2025-03-04 15:39:57,282 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:39:57,282 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2025-03-04 15:39:57,282 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 69 transitions. cyclomatic complexity: 19 Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 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:39:57,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:57,433 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 69 transitions. cyclomatic complexity: 19. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 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 266 states and 328 transitions. Complement of second has 13 states. [2025-03-04 15:39:57,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2025-03-04 15:39:57,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 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:39:57,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2025-03-04 15:39:57,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 38 transitions. Stem has 4 letters. Loop has 11 letters. [2025-03-04 15:39:57,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:57,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 38 transitions. Stem has 15 letters. Loop has 11 letters. [2025-03-04 15:39:57,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:57,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 38 transitions. Stem has 4 letters. Loop has 22 letters. [2025-03-04 15:39:57,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:57,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 266 states and 328 transitions. [2025-03-04 15:39:57,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2025-03-04 15:39:57,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 266 states to 205 states and 255 transitions. [2025-03-04 15:39:57,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-03-04 15:39:57,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-03-04 15:39:57,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 205 states and 255 transitions. [2025-03-04 15:39:57,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:39:57,438 INFO L218 hiAutomatonCegarLoop]: Abstraction has 205 states and 255 transitions. [2025-03-04 15:39:57,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states and 255 transitions. [2025-03-04 15:39:57,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 182. [2025-03-04 15:39:57,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 182 states have (on average 1.2747252747252746) internal successors, (232), 181 states have internal predecessors, (232), 0 states have call successors, (0), 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:39:57,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 232 transitions. [2025-03-04 15:39:57,444 INFO L240 hiAutomatonCegarLoop]: Abstraction has 182 states and 232 transitions. [2025-03-04 15:39:57,444 INFO L432 stractBuchiCegarLoop]: Abstraction has 182 states and 232 transitions. [2025-03-04 15:39:57,444 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 15:39:57,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 182 states and 232 transitions. [2025-03-04 15:39:57,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2025-03-04 15:39:57,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:57,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:57,445 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:39:57,445 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:39:57,446 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~nondet25#1, main_#t~nondet26#1, main_#t~ret27#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet25#1, main_#t~nondet26#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~short8#1, test_fun_#t~mem9#1, test_fun_#t~mem11#1, test_fun_#t~mem10#1, test_fun_#t~short12#1, test_fun_#t~short13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_#t~short16#1, test_fun_#t~mem17#1, test_fun_#t~mem18#1, test_fun_#t~mem19#1, test_fun_#t~mem20#1, test_fun_#t~mem21#1, test_fun_#t~mem22#1, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" "assume true;call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 >= 0;" "assume !test_fun_#t~short8#1;" "test_fun_#t~short13#1 := test_fun_#t~short8#1;" [2025-03-04 15:39:57,446 INFO L754 eck$LassoCheckResult]: Loop: "assume !test_fun_#t~short13#1;call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short12#1 := test_fun_#t~mem9#1 < 0;" "assume !test_fun_#t~short12#1;" "test_fun_#t~short13#1 := test_fun_#t~short12#1;" "test_fun_#t~short16#1 := test_fun_#t~short13#1;" "assume test_fun_#t~short16#1;call test_fun_#t~mem14#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short16#1 := test_fun_#t~mem14#1 + test_fun_#t~mem15#1 > 0;" "assume test_fun_#t~short16#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short8#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~short12#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~mem14#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~short16#1;call test_fun_#t~mem17#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem18#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem17#1 > test_fun_#t~mem18#1);havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem18#1;call test_fun_#t~mem20#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem21#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem20#1 == test_fun_#t~mem21#1);havoc test_fun_#t~mem20#1;havoc test_fun_#t~mem21#1;call test_fun_#t~mem23#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem23#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;" "assume true;call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 >= 0;" "assume !test_fun_#t~short8#1;" "test_fun_#t~short13#1 := test_fun_#t~short8#1;" [2025-03-04 15:39:57,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:57,446 INFO L85 PathProgramCache]: Analyzing trace with hash 56271192, now seen corresponding path program 1 times [2025-03-04 15:39:57,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:57,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112776783] [2025-03-04 15:39:57,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:57,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:57,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:39:57,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:39:57,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:57,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:57,455 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:57,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:39:57,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:39:57,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:57,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:57,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:57,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:57,461 INFO L85 PathProgramCache]: Analyzing trace with hash -655907045, now seen corresponding path program 1 times [2025-03-04 15:39:57,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:57,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363668385] [2025-03-04 15:39:57,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:57,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:57,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:39:57,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:39:57,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:57,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:57,497 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:39:57,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:39:57,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363668385] [2025-03-04 15:39:57,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363668385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:39:57,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:39:57,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:39:57,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527014975] [2025-03-04 15:39:57,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:39:57,498 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:39:57,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:39:57,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:39:57,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:39:57,498 INFO L87 Difference]: Start difference. First operand 182 states and 232 transitions. cyclomatic complexity: 59 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:57,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:39:57,514 INFO L93 Difference]: Finished difference Result 149 states and 167 transitions. [2025-03-04 15:39:57,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 167 transitions. [2025-03-04 15:39:57,515 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:39:57,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 0 states and 0 transitions. [2025-03-04 15:39:57,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:39:57,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:39:57,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:39:57,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:39:57,515 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:39:57,515 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:39:57,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:39:57,516 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:39:57,516 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 15:39:57,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 15:39:57,516 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:39:57,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 15:39:57,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:39:57 BoogieIcfgContainer [2025-03-04 15:39:57,522 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:39:57,523 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:39:57,523 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:39:57,523 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:39:57,523 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:39:48" (3/4) ... [2025-03-04 15:39:57,525 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 15:39:57,525 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:39:57,526 INFO L158 Benchmark]: Toolchain (without parser) took 9771.86ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 112.2MB in the beginning and 339.2MB in the end (delta: -227.1MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2025-03-04 15:39:57,526 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:39:57,526 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.43ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 95.8MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:39:57,526 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.29ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 94.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:39:57,526 INFO L158 Benchmark]: Boogie Preprocessor took 25.02ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 92.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:39:57,526 INFO L158 Benchmark]: IcfgBuilder took 274.72ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 76.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:39:57,527 INFO L158 Benchmark]: BuchiAutomizer took 9161.25ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 76.8MB in the beginning and 339.3MB in the end (delta: -262.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:39:57,527 INFO L158 Benchmark]: Witness Printer took 2.53ms. Allocated memory is still 402.7MB. Free memory was 339.3MB in the beginning and 339.2MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:39:57,528 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.29ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.43ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 95.8MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.29ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 94.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.02ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 92.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 274.72ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 76.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 9161.25ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 76.8MB in the beginning and 339.3MB in the end (delta: -262.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.53ms. Allocated memory is still 402.7MB. Free memory was 339.3MB in the beginning and 339.2MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function null and consists of 7 locations. One deterministic module has affine ranking function null and consists of 8 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.1s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 7.6s. Construction of modules took 0.1s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 26 StatesRemovedByMinimization, 3 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, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 139 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 325 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 198 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 220 IncrementalHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 127 mSDtfsCounter, 220 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital244 mio100 ax107 hnf100 lsp97 ukn63 mio100 lsp29 div100 bol106 ite100 ukn100 eq154 hnf91 smp98 dnf169 smp80 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 103ms VariablesStem: 5 VariablesLoop: 8 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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:39:57,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE