./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.05-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.05-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 2e8f354936443b9a529fcf41dfa5e3c742b35e7f73ef50360a09d67c1a48d74d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:39:41,177 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:39:41,226 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:41,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:39:41,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:39:41,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:39:41,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:39:41,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:39:41,254 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:39:41,255 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:39:41,255 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:39:41,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:39:41,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:39:41,256 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:39:41,256 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:39:41,256 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:39:41,257 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:39:41,257 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:39:41,257 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:39:41,257 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:39:41,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:39:41,257 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:39:41,257 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:39:41,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:39:41,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:39:41,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:39:41,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:39:41,257 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:39:41,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:39:41,258 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:39:41,258 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:39:41,258 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:39:41,258 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:39:41,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:39:41,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:39:41,258 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:39:41,259 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:39:41,259 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 -> 2e8f354936443b9a529fcf41dfa5e3c742b35e7f73ef50360a09d67c1a48d74d [2025-03-04 15:39:41,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:39:41,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:39:41,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:39:41,482 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:39:41,482 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:39:41,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.05-alloca.i [2025-03-04 15:39:42,607 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f39173bc/326811008d8046538870dbdbedc44981/FLAG97e72cf17 [2025-03-04 15:39:42,844 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:39:42,844 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.05-alloca.i [2025-03-04 15:39:42,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f39173bc/326811008d8046538870dbdbedc44981/FLAG97e72cf17 [2025-03-04 15:39:43,172 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f39173bc/326811008d8046538870dbdbedc44981 [2025-03-04 15:39:43,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:39:43,176 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:39:43,177 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:39:43,177 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:39:43,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:39:43,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:39:43" (1/1) ... [2025-03-04 15:39:43,181 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19b994e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:43, skipping insertion in model container [2025-03-04 15:39:43,181 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:39:43" (1/1) ... [2025-03-04 15:39:43,201 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:39:43,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:39:43,414 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:39:43,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:39:43,472 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:39:43,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:43 WrapperNode [2025-03-04 15:39:43,473 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:39:43,474 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:39:43,474 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:39:43,474 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:39:43,479 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:43" (1/1) ... [2025-03-04 15:39:43,490 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:43" (1/1) ... [2025-03-04 15:39:43,506 INFO L138 Inliner]: procedures = 111, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2025-03-04 15:39:43,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:39:43,508 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:39:43,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:39:43,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:39:43,512 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:43" (1/1) ... [2025-03-04 15:39:43,513 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:43" (1/1) ... [2025-03-04 15:39:43,514 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:43" (1/1) ... [2025-03-04 15:39:43,521 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [5, 6]. 55 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 5 writes are split as follows [2, 3]. [2025-03-04 15:39:43,521 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:43" (1/1) ... [2025-03-04 15:39:43,522 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:43" (1/1) ... [2025-03-04 15:39:43,524 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:43" (1/1) ... [2025-03-04 15:39:43,529 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:43" (1/1) ... [2025-03-04 15:39:43,530 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:43" (1/1) ... [2025-03-04 15:39:43,530 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:43" (1/1) ... [2025-03-04 15:39:43,531 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:39:43,532 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:39:43,532 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:39:43,532 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:39:43,533 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:43" (1/1) ... [2025-03-04 15:39:43,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:43,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:43,556 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:43,558 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:43,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:39:43,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:39:43,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:39:43,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:39:43,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:39:43,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:39:43,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:39:43,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:39:43,642 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:39:43,643 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:39:43,748 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L562: havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;havoc main_#t~ret17#1; [2025-03-04 15:39:43,748 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L559: havoc test_fun_#t~mem14#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; [2025-03-04 15:39:43,755 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-04 15:39:43,756 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:39:43,764 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:39:43,765 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:39:43,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:39:43 BoogieIcfgContainer [2025-03-04 15:39:43,765 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:39:43,766 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:39:43,766 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:39:43,770 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:39:43,771 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:39:43,772 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:39:43" (1/3) ... [2025-03-04 15:39:43,772 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d69fd05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:39:43, skipping insertion in model container [2025-03-04 15:39:43,772 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:39:43,772 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:43" (2/3) ... [2025-03-04 15:39:43,772 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d69fd05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:39:43, skipping insertion in model container [2025-03-04 15:39:43,772 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:39:43,772 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:39:43" (3/3) ... [2025-03-04 15:39:43,773 INFO L363 chiAutomizerObserver]: Analyzing ICFG b.05-alloca.i [2025-03-04 15:39:43,803 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:39:43,803 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:39:43,803 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:39:43,803 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:39:43,803 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:39:43,803 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:39:43,803 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:39:43,803 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:39:43,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:43,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:39:43,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:43,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:43,819 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:39:43,819 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:39:43,819 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:39:43,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:43,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:39:43,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:43,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:43,820 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:39:43,820 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:39:43,823 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~nondet15#1, main_#t~nondet16#1, main_#t~ret17#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~tmp#1 := main_#t~nondet15#1, main_#t~nondet16#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~nondet4#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~short11#1, test_fun_#t~mem12#1, test_fun_#t~nondet13#1, test_fun_#t~mem14#1, test_fun_~x#1, test_fun_~tmp#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~tmp#1 := test_fun_#in~tmp#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_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~tmp#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet4#1;call write~int#1(test_fun_#t~nondet4#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet4#1;" [2025-03-04 15:39:43,824 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0;" "assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int#1(test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 >= 0;" "test_fun_#t~short9#1 := test_fun_#t~short7#1;" "assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int#1(test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 1073741824;" "test_fun_#t~short11#1 := test_fun_#t~short9#1;" "assume test_fun_#t~short11#1;call test_fun_#t~mem10#1 := read~int#1(test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);test_fun_#t~short11#1 := test_fun_~x#1 == 2 * test_fun_#t~mem10#1;" "assume test_fun_#t~short11#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~short11#1;call test_fun_#t~mem12#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1;havoc test_fun_#t~nondet13#1;call write~int#1(test_fun_#t~nondet13#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet13#1;" [2025-03-04 15:39:43,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:43,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1664, now seen corresponding path program 1 times [2025-03-04 15:39:43,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:43,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220244127] [2025-03-04 15:39:43,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:43,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:43,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:39:43,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:39:43,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:43,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:43,920 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:43,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:39:43,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:39:43,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:43,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:43,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:43,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:43,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1927412911, now seen corresponding path program 1 times [2025-03-04 15:39:43,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:43,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875505846] [2025-03-04 15:39:43,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:43,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:43,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:39:43,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:39:43,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:43,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:43,979 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:43,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:39:43,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:39:43,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:43,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:44,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:44,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:44,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1118075216, now seen corresponding path program 1 times [2025-03-04 15:39:44,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:44,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306755973] [2025-03-04 15:39:44,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:44,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:44,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:39:44,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:39:44,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:44,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:44,034 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:44,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:39:44,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:39:44,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:44,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:44,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:44,611 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:39:44,612 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:39:44,612 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:39:44,612 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:39:44,612 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:39:44,612 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:44,612 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:39:44,612 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:39:44,613 INFO L132 ssoRankerPreferences]: Filename of dumped script: b.05-alloca.i_Iteration1_Lasso [2025-03-04 15:39:44,613 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:39:44,613 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:39:44,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:44,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:44,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:44,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:44,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:44,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:44,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:44,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:44,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:44,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:44,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:44,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:44,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:44,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:44,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:44,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:44,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:44,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:45,167 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:39:45,170 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:39:45,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:45,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:45,174 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:45,174 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:45,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:45,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:45,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:45,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:45,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:45,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:45,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:45,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:45,191 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:45,197 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:45,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:45,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:45,199 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:45,200 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:45,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:45,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:45,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:45,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:45,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:45,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:45,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:45,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:45,215 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:45,220 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:45,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:45,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:45,222 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:45,223 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:45,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:45,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:45,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:45,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:45,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:45,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:45,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:45,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:45,238 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:45,243 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:45,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:45,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:45,245 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:45,245 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:45,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:45,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:45,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:45,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:45,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:45,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:45,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:45,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:45,258 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:45,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:45,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:45,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:45,265 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:45,266 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:45,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:45,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:45,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:45,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:45,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:45,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:45,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:45,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:45,281 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:45,286 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:45,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:45,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:45,288 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:45,289 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:45,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:45,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:45,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:45,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:45,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:45,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:45,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:45,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:45,301 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:45,307 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:45,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:45,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:45,308 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:45,309 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:45,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:45,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:45,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:45,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:45,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:45,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:45,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:45,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:45,321 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:45,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:45,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:45,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:45,328 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:45,329 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:45,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:45,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:45,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:45,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:45,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:45,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:45,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:45,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:45,341 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:45,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:45,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:45,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:45,348 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:45,349 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:45,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:45,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:45,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:45,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:45,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:45,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:45,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:45,364 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:45,370 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:45,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:45,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:45,372 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:45,373 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:45,377 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:45,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:45,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:45,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:45,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:45,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:45,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:45,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:45,389 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:45,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-04 15:39:45,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:45,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:45,396 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:45,397 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:45,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:45,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:45,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:45,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:45,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:45,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:45,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:45,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:45,410 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:45,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-04 15:39:45,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:45,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:45,419 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:45,420 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:45,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:45,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:45,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:45,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:45,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:45,436 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:45,436 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:45,440 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:45,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-04 15:39:45,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:45,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:45,447 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:45,449 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:45,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:45,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:45,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:45,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:45,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:45,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:45,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:45,470 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:45,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:45,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:45,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:45,478 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:45,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:45,484 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:45,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:45,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:45,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:45,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:45,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:45,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:45,506 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:39:45,542 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-04 15:39:45,543 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2025-03-04 15:39:45,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:45,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:45,547 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:45,548 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:45,550 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:39:45,563 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:39:45,564 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:39:45,564 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_1 Supporting invariants [] [2025-03-04 15:39:45,570 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:45,594 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2025-03-04 15:39:45,599 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:39:45,600 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:39:45,600 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2025-03-04 15:39:45,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:45,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:39:45,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:39:45,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:45,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:45,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:39:45,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:45,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:39:45,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:39:45,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:45,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:45,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:39:45,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:45,767 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:45,783 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:39:45,785 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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:45,854 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 42 states and 57 transitions. Complement of second has 10 states. [2025-03-04 15:39:45,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 15:39:45,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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:45,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2025-03-04 15:39:45,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 2 letters. Loop has 7 letters. [2025-03-04 15:39:45,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:45,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 9 letters. Loop has 7 letters. [2025-03-04 15:39:45,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:45,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 2 letters. Loop has 14 letters. [2025-03-04 15:39:45,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:45,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 57 transitions. [2025-03-04 15:39:45,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:39:45,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 24 states and 33 transitions. [2025-03-04 15:39:45,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-04 15:39:45,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-04 15:39:45,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2025-03-04 15:39:45,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:39:45,874 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 33 transitions. [2025-03-04 15:39:45,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2025-03-04 15:39:45,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-03-04 15:39:45,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 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:45,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2025-03-04 15:39:45,894 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 32 transitions. [2025-03-04 15:39:45,894 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2025-03-04 15:39:45,894 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:39:45,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2025-03-04 15:39:45,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:39:45,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:45,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:45,896 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 15:39:45,896 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:39:45,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~nondet15#1, main_#t~nondet16#1, main_#t~ret17#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~tmp#1 := main_#t~nondet15#1, main_#t~nondet16#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~nondet4#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~short11#1, test_fun_#t~mem12#1, test_fun_#t~nondet13#1, test_fun_#t~mem14#1, test_fun_~x#1, test_fun_~tmp#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~tmp#1 := test_fun_#in~tmp#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_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~tmp#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet4#1;call write~int#1(test_fun_#t~nondet4#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet4#1;" "assume true;call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0;" [2025-03-04 15:39:45,896 INFO L754 eck$LassoCheckResult]: Loop: "assume !test_fun_#t~short7#1;" "test_fun_#t~short9#1 := test_fun_#t~short7#1;" "assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int#1(test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 1073741824;" "test_fun_#t~short11#1 := test_fun_#t~short9#1;" "assume test_fun_#t~short11#1;call test_fun_#t~mem10#1 := read~int#1(test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);test_fun_#t~short11#1 := test_fun_~x#1 == 2 * test_fun_#t~mem10#1;" "assume test_fun_#t~short11#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~short11#1;call test_fun_#t~mem12#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1;havoc test_fun_#t~nondet13#1;call write~int#1(test_fun_#t~nondet13#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet13#1;" "assume true;call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0;" [2025-03-04 15:39:45,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:45,898 INFO L85 PathProgramCache]: Analyzing trace with hash 51603, now seen corresponding path program 1 times [2025-03-04 15:39:45,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:45,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841972405] [2025-03-04 15:39:45,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:45,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:45,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:39:45,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:45,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:45,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:45,935 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:45,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:39:45,937 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:45,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:45,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:45,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:45,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:45,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:45,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1009401302, now seen corresponding path program 1 times [2025-03-04 15:39:45,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:45,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207592043] [2025-03-04 15:39:45,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:45,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:45,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:39:45,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:39:45,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:45,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:46,021 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,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:39:46,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207592043] [2025-03-04 15:39:46,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207592043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:39:46,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:39:46,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:39:46,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213766931] [2025-03-04 15:39:46,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:39:46,024 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:39:46,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:39:46,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:39:46,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:39:46,027 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:46,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:39:46,047 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2025-03-04 15:39:46,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2025-03-04 15:39:46,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:39:46,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 31 transitions. [2025-03-04 15:39:46,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-04 15:39:46,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:39:46,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2025-03-04 15:39:46,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:39:46,050 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-03-04 15:39:46,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2025-03-04 15:39:46,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-03-04 15:39:46,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:46,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2025-03-04 15:39:46,051 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 30 transitions. [2025-03-04 15:39:46,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:39:46,053 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2025-03-04 15:39:46,053 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:39:46,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2025-03-04 15:39:46,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:39:46,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:46,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:46,053 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 15:39:46,053 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:39:46,054 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~nondet15#1, main_#t~nondet16#1, main_#t~ret17#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~tmp#1 := main_#t~nondet15#1, main_#t~nondet16#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~nondet4#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~short11#1, test_fun_#t~mem12#1, test_fun_#t~nondet13#1, test_fun_#t~mem14#1, test_fun_~x#1, test_fun_~tmp#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~tmp#1 := test_fun_#in~tmp#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_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~tmp#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet4#1;call write~int#1(test_fun_#t~nondet4#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet4#1;" "assume true;call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0;" [2025-03-04 15:39:46,054 INFO L754 eck$LassoCheckResult]: Loop: "assume !test_fun_#t~short7#1;" "test_fun_#t~short9#1 := test_fun_#t~short7#1;" "assume !test_fun_#t~short9#1;" "test_fun_#t~short11#1 := test_fun_#t~short9#1;" "assume test_fun_#t~short11#1;call test_fun_#t~mem10#1 := read~int#1(test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);test_fun_#t~short11#1 := test_fun_~x#1 == 2 * test_fun_#t~mem10#1;" "assume test_fun_#t~short11#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~short11#1;call test_fun_#t~mem12#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1;havoc test_fun_#t~nondet13#1;call write~int#1(test_fun_#t~nondet13#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet13#1;" "assume true;call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0;" [2025-03-04 15:39:46,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:46,054 INFO L85 PathProgramCache]: Analyzing trace with hash 51603, now seen corresponding path program 2 times [2025-03-04 15:39:46,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:46,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463860936] [2025-03-04 15:39:46,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:39:46,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:46,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:39:46,065 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:46,065 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:39:46,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:46,065 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:46,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:39:46,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:39:46,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:46,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:46,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:46,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:46,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1010324823, now seen corresponding path program 1 times [2025-03-04 15:39:46,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:46,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850850556] [2025-03-04 15:39:46,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:46,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:46,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:39:46,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:39:46,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:46,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:46,129 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,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:39:46,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850850556] [2025-03-04 15:39:46,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850850556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:39:46,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:39:46,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:39:46,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851272136] [2025-03-04 15:39:46,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:39:46,130 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:39:46,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:39:46,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:39:46,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:39:46,131 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:39:46,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:39:46,151 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2025-03-04 15:39:46,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2025-03-04 15:39:46,151 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:39:46,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2025-03-04 15:39:46,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:39:46,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:39:46,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:39:46,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:39:46,151 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:39:46,151 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:39:46,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:39:46,153 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:39:46,153 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:39:46,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 15:39:46,153 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:39:46,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 15:39:46,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:39:46 BoogieIcfgContainer [2025-03-04 15:39:46,159 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:39:46,159 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:39:46,159 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:39:46,160 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:39:46,160 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:43" (3/4) ... [2025-03-04 15:39:46,161 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 15:39:46,162 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:39:46,162 INFO L158 Benchmark]: Toolchain (without parser) took 2986.80ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 86.7MB in the end (delta: 20.0MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2025-03-04 15:39:46,162 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:39:46,163 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.45ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 90.6MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:39:46,163 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.24ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 89.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:39:46,163 INFO L158 Benchmark]: Boogie Preprocessor took 23.82ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 87.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:39:46,163 INFO L158 Benchmark]: IcfgBuilder took 233.51ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 74.6MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:39:46,163 INFO L158 Benchmark]: BuchiAutomizer took 2392.99ms. Allocated memory is still 142.6MB. Free memory was 73.8MB in the beginning and 86.7MB in the end (delta: -12.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:39:46,163 INFO L158 Benchmark]: Witness Printer took 2.43ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 86.7MB in the end (delta: 21.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:39:46,165 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.16ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.45ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 90.6MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.24ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 89.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.82ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 87.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 233.51ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 74.6MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 2392.99ms. Allocated memory is still 142.6MB. Free memory was 73.8MB in the beginning and 86.7MB in the end (delta: -12.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.43ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 86.7MB in the end (delta: 21.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 56 IncrementalHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 26 mSDtfsCounter, 56 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital181 mio100 ax109 hnf100 lsp90 ukn75 mio100 lsp30 div100 bol100 ite100 ukn100 eq195 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-04 15:39:46,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE