./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.09_assume-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.09_assume-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 4cca1c0210c0a53cd372224714db019427e8e227743584713b4610995b14f457 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:39:44,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:39:44,218 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:44,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:39:44,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:39:44,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:39:44,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:39:44,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:39:44,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:39:44,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:39:44,251 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:39:44,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:39:44,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:39:44,251 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:39:44,252 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:39:44,252 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:39:44,252 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:39:44,252 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:39:44,252 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:39:44,252 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:39:44,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:39:44,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:39:44,253 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:39:44,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:39:44,253 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:39:44,253 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:39:44,253 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:39:44,253 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:39:44,253 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:39:44,253 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:39:44,253 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:39:44,253 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:39:44,253 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:39:44,254 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:39:44,254 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:39:44,254 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:39:44,254 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:39:44,255 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 -> 4cca1c0210c0a53cd372224714db019427e8e227743584713b4610995b14f457 [2025-03-04 15:39:44,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:39:44,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:39:44,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:39:44,465 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:39:44,465 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:39:44,467 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca.i [2025-03-04 15:39:45,630 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d05e7057/327468d236124b4689517bdbbe4fe8c4/FLAGb2686cfe2 [2025-03-04 15:39:45,896 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:39:45,898 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca.i [2025-03-04 15:39:45,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d05e7057/327468d236124b4689517bdbbe4fe8c4/FLAGb2686cfe2 [2025-03-04 15:39:45,927 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d05e7057/327468d236124b4689517bdbbe4fe8c4 [2025-03-04 15:39:45,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:39:45,934 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:39:45,936 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:39:45,936 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:39:45,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:39:45,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:39:45" (1/1) ... [2025-03-04 15:39:45,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35a9e03f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:45, skipping insertion in model container [2025-03-04 15:39:45,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:39:45" (1/1) ... [2025-03-04 15:39:45,973 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:39:46,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:39:46,169 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:39:46,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:39:46,222 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:39:46,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:46 WrapperNode [2025-03-04 15:39:46,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:39:46,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:39:46,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:39:46,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:39:46,228 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:46" (1/1) ... [2025-03-04 15:39:46,235 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:46" (1/1) ... [2025-03-04 15:39:46,249 INFO L138 Inliner]: procedures = 111, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 100 [2025-03-04 15:39:46,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:39:46,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:39:46,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:39:46,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:39:46,255 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:46" (1/1) ... [2025-03-04 15:39:46,255 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:46" (1/1) ... [2025-03-04 15:39:46,258 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:46" (1/1) ... [2025-03-04 15:39:46,269 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [4, 9, 4]. 53 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 [1, 3, 2]. [2025-03-04 15:39:46,269 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:46" (1/1) ... [2025-03-04 15:39:46,269 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:46" (1/1) ... [2025-03-04 15:39:46,272 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:46" (1/1) ... [2025-03-04 15:39:46,272 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:46" (1/1) ... [2025-03-04 15:39:46,273 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:46" (1/1) ... [2025-03-04 15:39:46,274 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:46" (1/1) ... [2025-03-04 15:39:46,275 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:39:46,275 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:39:46,275 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:39:46,276 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:39:46,276 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:46" (1/1) ... [2025-03-04 15:39:46,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:46,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:46,302 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:46,306 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:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:39:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:39:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:39:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:39:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:39:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:39:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:39:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:39:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:39:46,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:39:46,400 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:39:46,402 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:39:46,528 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L572: havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;havoc main_#t~ret19#1; [2025-03-04 15:39:46,528 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L569: havoc test_fun_#t~mem16#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:46,528 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L563: havoc test_fun_#t~mem13#1; [2025-03-04 15:39:46,541 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-04 15:39:46,543 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:39:46,549 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:39:46,549 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:39:46,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:39:46 BoogieIcfgContainer [2025-03-04 15:39:46,549 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:39:46,550 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:39:46,550 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:39:46,556 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:39:46,556 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:39:46,556 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:39:45" (1/3) ... [2025-03-04 15:39:46,557 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39b34d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:39:46, skipping insertion in model container [2025-03-04 15:39:46,557 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:39:46,557 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:46" (2/3) ... [2025-03-04 15:39:46,558 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39b34d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:39:46, skipping insertion in model container [2025-03-04 15:39:46,558 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:39:46,558 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:39:46" (3/3) ... [2025-03-04 15:39:46,559 INFO L363 chiAutomizerObserver]: Analyzing ICFG b.09_assume-alloca.i [2025-03-04 15:39:46,594 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:39:46,594 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:39:46,594 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:39:46,595 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:39:46,595 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:39:46,595 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:39:46,595 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:39:46,595 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:39:46,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:46,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:39:46,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:46,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:46,616 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:39:46,616 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 15:39:46,616 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:39:46,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:46,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:39:46,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:46,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:46,620 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:39:46,620 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 15:39:46,624 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~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet17#1, main_#t~nondet18#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~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_#t~mem16#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#1(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(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);call test_fun_#t~mem5#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 <= 0;" "assume test_fun_#t~short7#1;" "assume !test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;" [2025-03-04 15:39:46,624 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem8#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !(0 == test_fun_#t~mem8#1);havoc test_fun_#t~mem8#1;call test_fun_#t~mem9#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume test_fun_#t~mem9#1 > test_fun_#t~mem10#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem11#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1;" "call test_fun_#t~mem15#1 := read~int#2(test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem15#1, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);havoc test_fun_#t~mem15#1;" [2025-03-04 15:39:46,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:46,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1753662, now seen corresponding path program 1 times [2025-03-04 15:39:46,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:46,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087890100] [2025-03-04 15:39:46,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:46,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:46,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:39:46,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:39:46,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:46,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:46,796 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:46,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:39:46,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087890100] [2025-03-04 15:39:46,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087890100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:39:46,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:39:46,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:39:46,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223607580] [2025-03-04 15:39:46,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:39:46,800 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:39:46,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:46,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1507103, now seen corresponding path program 1 times [2025-03-04 15:39:46,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:46,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27028130] [2025-03-04 15:39:46,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:46,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:46,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:39:46,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:39:46,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:46,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:46,811 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:46,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:39:46,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:39:46,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:46,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:46,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:47,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:39:47,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:39:47,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:39:47,036 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:39:47,051 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2025-03-04 15:39:47,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2025-03-04 15:39:47,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:39:47,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 10 states and 11 transitions. [2025-03-04 15:39:47,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-04 15:39:47,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:39:47,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2025-03-04 15:39:47,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:39:47,060 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-03-04 15:39:47,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2025-03-04 15:39:47,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-04 15:39:47,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2025-03-04 15:39:47,077 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-03-04 15:39:47,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:39:47,082 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-03-04 15:39:47,082 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:39:47,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2025-03-04 15:39:47,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:39:47,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:47,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:47,083 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:39:47,083 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 15:39:47,083 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~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet17#1, main_#t~nondet18#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~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_#t~mem16#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#1(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(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);call test_fun_#t~mem5#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 <= 0;" "assume !test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 <= 0;" "assume !test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;" [2025-03-04 15:39:47,083 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem8#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !(0 == test_fun_#t~mem8#1);havoc test_fun_#t~mem8#1;call test_fun_#t~mem9#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume test_fun_#t~mem9#1 > test_fun_#t~mem10#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem11#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1;" "call test_fun_#t~mem15#1 := read~int#2(test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem15#1, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);havoc test_fun_#t~mem15#1;" [2025-03-04 15:39:47,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:47,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1753631, now seen corresponding path program 1 times [2025-03-04 15:39:47,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:47,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923466812] [2025-03-04 15:39:47,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:47,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:47,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:39:47,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:47,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:47,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:47,118 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:47,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:39:47,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:39:47,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:47,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:47,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:47,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:47,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1507103, now seen corresponding path program 2 times [2025-03-04 15:39:47,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:47,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686154156] [2025-03-04 15:39:47,157 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:39:47,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:47,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:39:47,175 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:47,175 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:39:47,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:47,175 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:47,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:39:47,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:39:47,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:47,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:47,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:47,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:47,187 INFO L85 PathProgramCache]: Analyzing trace with hash 312967741, now seen corresponding path program 1 times [2025-03-04 15:39:47,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:47,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897822611] [2025-03-04 15:39:47,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:47,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:47,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:39:47,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:39:47,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:47,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:47,209 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:47,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:39:47,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:39:47,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:47,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:47,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:47,747 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:39:47,748 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:39:47,748 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:39:47,748 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:39:47,748 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:39:47,748 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:47,748 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:39:47,748 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:39:47,749 INFO L132 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca.i_Iteration2_Lasso [2025-03-04 15:39:47,749 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:39:47,749 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:39:47,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:47,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:47,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:47,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:47,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:47,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:47,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:47,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:47,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:48,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:48,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:48,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:48,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:48,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:48,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:48,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:48,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:48,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:48,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:48,576 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:39:48,579 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:39:48,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:48,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:48,582 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:48,583 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:48,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:48,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:48,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:48,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:48,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:48,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:48,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:48,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:48,603 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:48,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-04 15:39:48,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:48,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:48,611 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:48,612 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:48,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:48,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:48,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:48,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:48,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:48,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:48,624 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:48,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:48,625 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:48,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-04 15:39:48,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:48,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:48,632 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:48,633 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:48,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:48,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:48,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:48,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:48,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:48,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:48,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:48,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:48,647 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:48,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:48,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:48,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:48,655 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:48,656 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:48,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:48,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:48,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:48,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:48,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:48,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:48,670 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:48,672 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:48,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-04 15:39:48,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:48,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:48,680 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:48,681 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:48,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:48,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:48,691 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:48,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:48,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:48,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:48,692 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:48,692 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:48,693 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:48,698 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:48,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:48,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:48,700 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:48,700 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:48,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:48,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:48,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:48,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:48,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:48,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:48,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:48,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:48,712 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:48,717 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:48,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:48,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:48,719 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:48,719 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:48,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:48,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:48,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:48,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:48,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:48,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:48,732 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:48,732 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:48,733 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:48,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-04 15:39:48,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:48,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:48,739 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:48,740 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:48,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:48,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:48,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:48,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:48,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:48,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:48,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:48,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:48,752 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:48,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-04 15:39:48,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:48,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:48,759 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:48,761 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:48,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:48,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:48,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:48,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:48,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:48,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:48,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:48,783 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:48,789 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:48,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:48,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:48,791 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:48,793 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:48,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:48,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:48,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:48,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:48,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:48,810 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:48,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:48,816 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:48,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:48,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:48,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:48,824 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:48,828 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:48,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:48,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:48,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:48,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:48,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:48,845 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:48,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:48,852 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:48,858 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:48,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:48,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:48,861 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:48,863 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:48,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:48,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:48,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:48,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:48,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:48,876 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:48,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:48,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:48,889 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:48,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:48,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:48,892 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:48,893 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:48,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:48,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:48,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:48,904 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:39:48,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:48,915 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-03-04 15:39:48,915 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-04 15:39:48,933 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:39:49,016 INFO L443 ModelExtractionUtils]: Simplification made 31 calls to the SMT solver. [2025-03-04 15:39:49,018 INFO L444 ModelExtractionUtils]: 1 out of 26 variables were initially zero. Simplification set additionally 22 variables to zero. [2025-03-04 15:39:49,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:49,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:49,022 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:49,024 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:49,025 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:39:49,038 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-03-04 15:39:49,038 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:39:49,039 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_1) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_1 Supporting invariants [1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_1 >= 0] [2025-03-04 15:39:49,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-04 15:39:49,100 INFO L156 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed [2025-03-04 15:39:49,105 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 15:39:49,106 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 15:39:49,106 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2025-03-04 15:39:49,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:49,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:39:49,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:39:49,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:49,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:49,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:39:49,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:49,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-04 15:39:49,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:39:49,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:39:49,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:49,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:49,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:39:49,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:49,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-03-04 15:39:49,313 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:49,315 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2025-03-04 15:39:49,316 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 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:49,374 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 20 states and 23 transitions. Complement of second has 8 states. [2025-03-04 15:39:49,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:39:49,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 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:49,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2025-03-04 15:39:49,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 4 letters. Loop has 4 letters. [2025-03-04 15:39:49,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:49,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 8 letters. Loop has 4 letters. [2025-03-04 15:39:49,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:49,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 4 letters. Loop has 8 letters. [2025-03-04 15:39:49,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:49,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2025-03-04 15:39:49,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:39:49,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2025-03-04 15:39:49,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-04 15:39:49,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-04 15:39:49,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2025-03-04 15:39:49,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:39:49,382 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-03-04 15:39:49,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2025-03-04 15:39:49,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-03-04 15:39:49,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 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:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2025-03-04 15:39:49,383 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2025-03-04 15:39:49,383 INFO L432 stractBuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2025-03-04 15:39:49,383 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:39:49,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2025-03-04 15:39:49,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:39:49,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:49,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:49,383 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:39:49,383 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:39:49,385 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~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet17#1, main_#t~nondet18#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~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_#t~mem16#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#1(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(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);call test_fun_#t~mem5#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 <= 0;" "assume !test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 <= 0;" "assume !test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;" "assume true;call test_fun_#t~mem8#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" [2025-03-04 15:39:49,385 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == test_fun_#t~mem8#1);havoc test_fun_#t~mem8#1;call test_fun_#t~mem9#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem12#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem12#1 <= 0);havoc test_fun_#t~mem12#1;" "call test_fun_#t~mem14#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem14#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem14#1;" "call test_fun_#t~mem15#1 := read~int#2(test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem15#1, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);havoc test_fun_#t~mem15#1;" "assume true;call test_fun_#t~mem8#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" [2025-03-04 15:39:49,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:49,386 INFO L85 PathProgramCache]: Analyzing trace with hash 54362580, now seen corresponding path program 1 times [2025-03-04 15:39:49,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:49,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624384928] [2025-03-04 15:39:49,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:49,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:49,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:39:49,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:39:49,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:49,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:49,414 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:49,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:39:49,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:39:49,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:49,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:49,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:49,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:49,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1416153861, now seen corresponding path program 1 times [2025-03-04 15:39:49,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:49,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725078222] [2025-03-04 15:39:49,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:49,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:49,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:39:49,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:39:49,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:49,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:49,434 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:49,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:39:49,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:39:49,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:49,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:49,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:49,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:49,446 INFO L85 PathProgramCache]: Analyzing trace with hash -746298728, now seen corresponding path program 1 times [2025-03-04 15:39:49,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:49,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687737376] [2025-03-04 15:39:49,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:49,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:49,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:39:49,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:39:49,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:49,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:49,464 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:49,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:39:49,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:39:49,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:49,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:49,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:49,969 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:39:49,970 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:39:49,970 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:39:49,970 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:39:49,970 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:39:49,970 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:49,970 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:39:49,970 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:39:49,970 INFO L132 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca.i_Iteration3_Lasso [2025-03-04 15:39:49,970 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:39:49,970 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:39:49,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:49,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:50,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:50,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:50,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:50,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:50,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:50,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:50,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:50,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:50,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:50,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:50,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:50,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:50,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:50,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:50,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:50,513 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:39:50,513 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:39:50,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:50,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:50,516 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:50,517 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:50,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:50,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:50,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:50,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:50,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:50,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:50,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:50,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:50,531 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:50,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-04 15:39:50,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:50,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:50,539 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:50,540 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:50,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:50,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:50,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:50,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:50,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:50,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:50,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:50,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:50,553 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:50,558 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:50,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:50,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:50,560 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:50,561 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:50,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:50,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:50,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:50,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:50,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:50,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:50,577 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:50,584 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:50,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:50,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:50,586 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:50,587 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:50,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:50,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:50,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:50,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:50,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:50,599 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:50,599 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:50,603 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:50,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-04 15:39:50,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:50,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:50,611 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:50,611 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:50,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:50,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:50,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:50,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:50,623 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:50,623 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:50,625 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:50,631 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:50,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:50,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:50,633 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:50,635 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:50,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:50,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:50,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:50,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:50,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:50,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:50,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:50,653 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:50,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:50,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:50,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:50,661 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:50,663 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:50,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:50,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:50,673 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:39:50,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:50,680 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-03-04 15:39:50,680 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-04 15:39:50,695 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:39:50,710 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-03-04 15:39:50,711 INFO L444 ModelExtractionUtils]: 5 out of 21 variables were initially zero. Simplification set additionally 14 variables to zero. [2025-03-04 15:39:50,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:50,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:50,713 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:50,714 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:50,714 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:39:50,725 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-03-04 15:39:50,726 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:39:50,726 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 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#1 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:50,732 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:50,775 INFO L156 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2025-03-04 15:39:50,776 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 15:39:50,776 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 15:39:50,776 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2025-03-04 15:39:50,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:50,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:39:50,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:39:50,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:50,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:50,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:39:50,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:50,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:39:50,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:39:50,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:50,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:50,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:39:50,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:50,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 16 [2025-03-04 15:39:50,858 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,858 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-03-04 15:39:50,859 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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:50,887 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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) Result 43 states and 49 transitions. Complement of second has 9 states. [2025-03-04 15:39:50,888 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,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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:50,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2025-03-04 15:39:50,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2025-03-04 15:39:50,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:50,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 11 letters. Loop has 6 letters. [2025-03-04 15:39:50,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:50,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 12 letters. [2025-03-04 15:39:50,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:50,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 49 transitions. [2025-03-04 15:39:50,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:39:50,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 28 states and 32 transitions. [2025-03-04 15:39:50,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-04 15:39:50,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-04 15:39:50,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2025-03-04 15:39:50,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:39:50,891 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-04 15:39:50,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2025-03-04 15:39:50,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-04 15:39:50,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 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,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-03-04 15:39:50,894 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-04 15:39:50,894 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-04 15:39:50,894 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:39:50,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2025-03-04 15:39:50,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:39:50,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:50,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:50,896 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:39:50,896 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:39:50,896 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~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet17#1, main_#t~nondet18#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~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_#t~mem16#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#1(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(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);call test_fun_#t~mem5#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 <= 0;" "assume !test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 <= 0;" "assume !test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;" "assume true;call test_fun_#t~mem8#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !(0 == test_fun_#t~mem8#1);havoc test_fun_#t~mem8#1;call test_fun_#t~mem9#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume test_fun_#t~mem9#1 > test_fun_#t~mem10#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem11#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1;" "call test_fun_#t~mem15#1 := read~int#2(test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem15#1, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);havoc test_fun_#t~mem15#1;" [2025-03-04 15:39:50,896 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem8#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !(0 == test_fun_#t~mem8#1);havoc test_fun_#t~mem8#1;call test_fun_#t~mem9#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem12#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem12#1 <= 0);havoc test_fun_#t~mem12#1;" "call test_fun_#t~mem14#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem14#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem14#1;" "call test_fun_#t~mem15#1 := read~int#2(test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem15#1, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);havoc test_fun_#t~mem15#1;" [2025-03-04 15:39:50,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:50,896 INFO L85 PathProgramCache]: Analyzing trace with hash 312967741, now seen corresponding path program 2 times [2025-03-04 15:39:50,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:50,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110635016] [2025-03-04 15:39:50,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:39:50,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:50,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:39:50,912 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:39:50,912 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:39:50,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:50,913 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:50,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:39:50,919 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,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:50,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:50,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:50,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:50,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1448510781, now seen corresponding path program 2 times [2025-03-04 15:39:50,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:50,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786756061] [2025-03-04 15:39:50,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:39:50,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:50,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:39:50,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:39:50,931 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:39:50,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:50,931 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:50,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:39:50,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:39:50,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:50,936 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,938 INFO L85 PathProgramCache]: Analyzing trace with hash -540382599, now seen corresponding path program 1 times [2025-03-04 15:39:50,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:50,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582685085] [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,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:39:50,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:39:50,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:50,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:50,966 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:50,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:39:50,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 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,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:51,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-04 15:39:51,852 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:39:51,853 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:39:51,853 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:39:51,853 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:39:51,853 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:39:51,853 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:51,853 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:39:51,853 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:39:51,853 INFO L132 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca.i_Iteration4_Lasso [2025-03-04 15:39:51,853 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:39:51,853 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:39:51,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:51,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:52,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:52,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:52,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:52,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:52,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:52,331 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:39:52,331 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:39:52,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,333 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:52,334 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:52,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:52,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:52,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:52,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:52,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:52,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:52,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:52,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:52,346 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:52,352 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:52,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,354 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:52,355 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:52,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:52,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:52,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:52,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:52,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:52,366 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:52,366 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:52,366 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:52,372 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:52,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,374 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:52,374 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:52,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:52,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:52,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:52,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:52,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:52,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:52,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:52,387 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:52,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-04 15:39:52,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,394 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:52,395 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:52,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:52,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:52,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:52,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:52,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:52,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:52,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:52,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:52,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:52,412 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:52,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,414 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:52,415 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:52,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:52,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:52,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:52,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:52,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:52,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:52,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:52,428 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:52,437 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:52,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,439 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:52,440 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:52,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:52,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:52,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:52,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:52,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:52,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:52,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:52,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:52,452 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:52,457 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:52,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,459 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:52,460 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:52,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:52,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:52,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:52,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:52,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:52,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:52,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:52,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:52,471 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:52,477 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:52,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,479 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:52,479 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:52,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:52,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:52,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:52,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:52,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:52,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:52,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:52,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:52,491 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:52,496 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:52,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,498 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:52,500 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:52,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [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,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:52,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:52,512 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:52,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:52,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,520 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:52,522 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:52,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:52,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:52,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:52,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:52,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:52,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:52,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:52,534 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:52,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:52,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,542 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:52,543 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:52,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:52,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:52,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:52,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:52,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:52,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:52,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:52,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:52,556 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:52,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:52,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,564 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:52,566 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:52,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:52,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:52,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:52,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:52,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:52,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:52,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:52,578 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:52,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:52,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,586 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:52,587 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:52,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:52,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:52,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:52,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:52,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:52,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:52,604 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:52,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:52,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,611 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:52,612 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:52,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:52,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:52,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:52,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:52,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:52,625 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:52,625 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:52,629 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:52,634 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:52,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,636 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:52,637 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:52,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:52,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:52,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:52,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:52,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:52,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:52,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:52,652 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:52,657 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:52,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,659 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:52,660 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:52,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:52,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:52,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:52,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:52,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:52,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:52,680 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:52,686 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:52,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,688 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:52,688 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:52,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:52,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:52,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:52,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:52,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:52,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:52,707 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:39:52,717 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-03-04 15:39:52,717 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-04 15:39:52,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:52,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:52,719 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:52,721 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:52,721 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:39:52,732 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:39:52,732 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:39:52,732 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_3) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_3 Supporting invariants [] [2025-03-04 15:39:52,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:52,781 INFO L156 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2025-03-04 15:39:52,782 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 15:39:52,782 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 15:39:52,782 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2025-03-04 15:39:52,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:52,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:39:52,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:39:52,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:52,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:52,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:39:52,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:52,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:39:52,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:39:52,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:52,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:52,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:39:52,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:52,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 16 [2025-03-04 15:39:52,867 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,867 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-03-04 15:39:52,867 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 32 transitions. cyclomatic complexity: 7 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:52,904 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 32 transitions. cyclomatic complexity: 7. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 69 states and 80 transitions. Complement of second has 9 states. [2025-03-04 15:39:52,905 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:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:52,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2025-03-04 15:39:52,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 8 letters. Loop has 6 letters. [2025-03-04 15:39:52,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:52,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 14 letters. Loop has 6 letters. [2025-03-04 15:39:52,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:52,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 8 letters. Loop has 12 letters. [2025-03-04 15:39:52,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:52,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 80 transitions. [2025-03-04 15:39:52,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:39:52,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 46 states and 53 transitions. [2025-03-04 15:39:52,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-04 15:39:52,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-04 15:39:52,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 53 transitions. [2025-03-04 15:39:52,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:39:52,911 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 53 transitions. [2025-03-04 15:39:52,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 53 transitions. [2025-03-04 15:39:52,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2025-03-04 15:39:52,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:52,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2025-03-04 15:39:52,916 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-03-04 15:39:52,916 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-03-04 15:39:52,916 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:39:52,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2025-03-04 15:39:52,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:39:52,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:52,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:52,916 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 15:39:52,916 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:39:52,916 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~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet17#1, main_#t~nondet18#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~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_#t~mem16#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#1(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(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);call test_fun_#t~mem5#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 <= 0;" "assume !test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 <= 0;" "assume !test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;" "assume true;call test_fun_#t~mem8#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !(0 == test_fun_#t~mem8#1);havoc test_fun_#t~mem8#1;call test_fun_#t~mem9#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume test_fun_#t~mem9#1 > test_fun_#t~mem10#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem11#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1;" "call test_fun_#t~mem15#1 := read~int#2(test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem15#1, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);havoc test_fun_#t~mem15#1;" "assume true;call test_fun_#t~mem8#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !(0 == test_fun_#t~mem8#1);havoc test_fun_#t~mem8#1;call test_fun_#t~mem9#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume test_fun_#t~mem9#1 > test_fun_#t~mem10#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem11#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1;" "call test_fun_#t~mem15#1 := read~int#2(test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem15#1, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);havoc test_fun_#t~mem15#1;" [2025-03-04 15:39:52,916 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem8#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !(0 == test_fun_#t~mem8#1);havoc test_fun_#t~mem8#1;call test_fun_#t~mem9#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem12#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem12#1 <= 0);havoc test_fun_#t~mem12#1;" "call test_fun_#t~mem14#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem14#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem14#1;" "call test_fun_#t~mem15#1 := read~int#2(test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem15#1, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);havoc test_fun_#t~mem15#1;" [2025-03-04 15:39:52,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:52,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1837431973, now seen corresponding path program 3 times [2025-03-04 15:39:52,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:52,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548517648] [2025-03-04 15:39:52,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:39:52,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:52,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:52,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 2 equivalence classes. [2025-03-04 15:39:52,959 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:39:52,959 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 15:39:52,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:53,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:39:53,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:39:53,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548517648] [2025-03-04 15:39:53,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548517648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:39:53,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:39:53,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:39:53,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124233237] [2025-03-04 15:39:53,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:39:53,082 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:39:53,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:53,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1448510781, now seen corresponding path program 3 times [2025-03-04 15:39:53,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:53,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857133759] [2025-03-04 15:39:53,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:39:53,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:53,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:39:53,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:39:53,087 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:39:53,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:53,087 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:53,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:39:53,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:39:53,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:53,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:53,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:53,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:39:53,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:39:53,197 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 31 states and 36 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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:53,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:39:53,219 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2025-03-04 15:39:53,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 44 transitions. [2025-03-04 15:39:53,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:39:53,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 22 states and 23 transitions. [2025-03-04 15:39:53,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-04 15:39:53,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-03-04 15:39:53,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2025-03-04 15:39:53,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:39:53,222 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 23 transitions. [2025-03-04 15:39:53,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2025-03-04 15:39:53,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-03-04 15:39:53,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.05) internal successors, (21), 19 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:53,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2025-03-04 15:39:53,223 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 21 transitions. [2025-03-04 15:39:53,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:39:53,226 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2025-03-04 15:39:53,226 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:39:53,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 21 transitions. [2025-03-04 15:39:53,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:39:53,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:53,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:53,226 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:39:53,226 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:39:53,226 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet17#1, main_#t~nondet18#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~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_#t~mem16#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#1(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(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);call test_fun_#t~mem5#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 <= 0;" "assume !test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 <= 0;" "assume !test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;" "assume true;call test_fun_#t~mem8#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !(0 == test_fun_#t~mem8#1);havoc test_fun_#t~mem8#1;call test_fun_#t~mem9#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem12#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem12#1 <= 0);havoc test_fun_#t~mem12#1;" "call test_fun_#t~mem14#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem14#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem14#1;" "call test_fun_#t~mem15#1 := read~int#2(test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem15#1, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);havoc test_fun_#t~mem15#1;" "assume true;call test_fun_#t~mem8#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !(0 == test_fun_#t~mem8#1);havoc test_fun_#t~mem8#1;call test_fun_#t~mem9#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume test_fun_#t~mem9#1 > test_fun_#t~mem10#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem11#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1;" [2025-03-04 15:39:53,226 INFO L754 eck$LassoCheckResult]: Loop: "call test_fun_#t~mem15#1 := read~int#2(test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem15#1, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);havoc test_fun_#t~mem15#1;" "assume true;call test_fun_#t~mem8#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !(0 == test_fun_#t~mem8#1);havoc test_fun_#t~mem8#1;call test_fun_#t~mem9#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem12#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem12#1 <= 0);havoc test_fun_#t~mem12#1;" "call test_fun_#t~mem14#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem14#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem14#1;" [2025-03-04 15:39:53,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:53,227 INFO L85 PathProgramCache]: Analyzing trace with hash 66461390, now seen corresponding path program 2 times [2025-03-04 15:39:53,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:53,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031549160] [2025-03-04 15:39:53,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:39:53,227 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 OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 15:39:53,246 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:39:53,246 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:39:53,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:53,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:39:53,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:39:53,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031549160] [2025-03-04 15:39:53,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031549160] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:39:53,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227039053] [2025-03-04 15:39:53,391 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:39:53,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:39:53,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:53,393 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:39:53,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2025-03-04 15:39:53,452 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 15:39:53,467 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:39:53,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:39:53,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:53,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:39:53,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:53,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 17 [2025-03-04 15:39:53,503 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:53,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 15:39:53,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:39:53,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:39:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:39:53,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227039053] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:39:53,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:39:53,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 15:39:53,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471277121] [2025-03-04 15:39:53,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:39:53,548 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:39:53,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:53,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1106004741, now seen corresponding path program 4 times [2025-03-04 15:39:53,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:53,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378653375] [2025-03-04 15:39:53,549 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:39:53,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:53,554 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 6 statements into 2 equivalence classes. [2025-03-04 15:39:53,557 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:39:53,557 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:39:53,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:53,557 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:53,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:39:53,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:39:53,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:53,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:53,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:53,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:39:53,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:39:53,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:39:53,663 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. cyclomatic complexity: 3 Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:53,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:39:53,694 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2025-03-04 15:39:53,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 18 transitions. [2025-03-04 15:39:53,694 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:39:53,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2025-03-04 15:39:53,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:39:53,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:39:53,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:39:53,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:39:53,694 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:39:53,694 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:39:53,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:39:53,695 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:39:53,695 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 15:39:53,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 15:39:53,695 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:39:53,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 15:39:53,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:39:53 BoogieIcfgContainer [2025-03-04 15:39:53,700 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:39:53,701 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:39:53,701 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:39:53,701 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:39:53,701 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:46" (3/4) ... [2025-03-04 15:39:53,702 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 15:39:53,703 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:39:53,703 INFO L158 Benchmark]: Toolchain (without parser) took 7769.36ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 111.9MB in the beginning and 105.7MB in the end (delta: 6.1MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2025-03-04 15:39:53,703 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:39:53,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.19ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 95.5MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:39:53,704 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.53ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 94.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:39:53,704 INFO L158 Benchmark]: Boogie Preprocessor took 25.41ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:39:53,704 INFO L158 Benchmark]: IcfgBuilder took 274.02ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 78.4MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:39:53,704 INFO L158 Benchmark]: BuchiAutomizer took 7150.27ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 78.4MB in the beginning and 105.8MB in the end (delta: -27.4MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2025-03-04 15:39:53,704 INFO L158 Benchmark]: Witness Printer took 2.13ms. Allocated memory is still 176.2MB. Free memory was 105.8MB in the beginning and 105.7MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:39:53,705 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.24ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 287.19ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 95.5MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.53ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 94.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.41ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 274.02ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 78.4MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 7150.27ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 78.4MB in the beginning and 105.8MB in the end (delta: -27.4MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. * Witness Printer took 2.13ms. Allocated memory is still 176.2MB. Free memory was 105.8MB in the beginning and 105.7MB in the end (delta: 33.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#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x_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[~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[~x_ref~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.1s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 19 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 126 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 117 IncrementalHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 63 mSDtfsCounter, 117 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU3 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital261 mio100 ax106 hnf100 lsp93 ukn68 mio100 lsp21 div100 bol100 ite100 ukn100 eq164 hnf90 smp100 dnf122 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 149ms VariablesStem: 4 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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:53,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:53,915 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