./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-linkedlists/cll_traverse-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-linkedlists/cll_traverse-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 e315cf3165b5c80f73630ff082828d53fc68117bd863ad55d6a1d7f1b3bce898 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:54:58,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:54:58,454 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-09 06:54:58,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:54:58,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:54:58,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 06:54:58,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:54:58,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:54:58,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:54:58,486 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:54:58,486 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:54:58,486 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:54:58,487 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:54:58,487 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:54:58,487 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 06:54:58,487 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 06:54:58,487 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 06:54:58,487 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 06:54:58,488 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 06:54:58,488 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 06:54:58,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:54:58,488 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 06:54:58,488 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:54:58,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:54:58,488 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 06:54:58,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 06:54:58,488 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 06:54:58,488 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:54:58,488 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:54:58,488 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 06:54:58,488 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:54:58,489 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:54:58,489 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:54:58,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:54:58,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:54:58,489 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:54:58,490 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 06:54:58,490 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 -> e315cf3165b5c80f73630ff082828d53fc68117bd863ad55d6a1d7f1b3bce898 [2025-03-09 06:54:58,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:54:58,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:54:58,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:54:58,741 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:54:58,742 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:54:58,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-linkedlists/cll_traverse-alloca.i [2025-03-09 06:54:59,948 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddffab4f4/2f6077c21de74591b0276fed9223a6f0/FLAG8d3229356 [2025-03-09 06:55:00,190 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:55:00,190 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-linkedlists/cll_traverse-alloca.i [2025-03-09 06:55:00,197 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddffab4f4/2f6077c21de74591b0276fed9223a6f0/FLAG8d3229356 [2025-03-09 06:55:00,518 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddffab4f4/2f6077c21de74591b0276fed9223a6f0 [2025-03-09 06:55:00,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:55:00,520 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:55:00,521 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:55:00,521 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:55:00,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:55:00,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:55:00" (1/1) ... [2025-03-09 06:55:00,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@559962ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:00, skipping insertion in model container [2025-03-09 06:55:00,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:55:00" (1/1) ... [2025-03-09 06:55:00,543 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:55:00,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:55:00,711 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:55:00,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:55:00,768 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:55:00,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:00 WrapperNode [2025-03-09 06:55:00,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:55:00,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:55:00,769 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:55:00,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:55:00,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:00" (1/1) ... [2025-03-09 06:55:00,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:00" (1/1) ... [2025-03-09 06:55:00,788 INFO L138 Inliner]: procedures = 114, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 42 [2025-03-09 06:55:00,788 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:55:00,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:55:00,788 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:55:00,789 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:55:00,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:00" (1/1) ... [2025-03-09 06:55:00,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:00" (1/1) ... [2025-03-09 06:55:00,795 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:00" (1/1) ... [2025-03-09 06:55:00,802 INFO L175 MemorySlicer]: Split 5 memory accesses to 1 slices as follows [5]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 4 writes are split as follows [4]. [2025-03-09 06:55:00,802 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:00" (1/1) ... [2025-03-09 06:55:00,802 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:00" (1/1) ... [2025-03-09 06:55:00,806 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:00" (1/1) ... [2025-03-09 06:55:00,806 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:00" (1/1) ... [2025-03-09 06:55:00,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:00" (1/1) ... [2025-03-09 06:55:00,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:00" (1/1) ... [2025-03-09 06:55:00,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:55:00,808 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:55:00,808 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:55:00,808 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:55:00,809 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:00" (1/1) ... [2025-03-09 06:55:00,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:00,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:00,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:00,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-09 06:55:00,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:55:00,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 06:55:00,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 06:55:00,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 06:55:00,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:55:00,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:55:00,928 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:55:00,929 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:55:01,027 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-09 06:55:01,029 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:55:01,033 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:55:01,034 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:55:01,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:55:01 BoogieIcfgContainer [2025-03-09 06:55:01,034 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:55:01,034 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 06:55:01,035 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 06:55:01,038 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 06:55:01,038 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:55:01,039 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 06:55:00" (1/3) ... [2025-03-09 06:55:01,039 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74dfb8f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:55:01, skipping insertion in model container [2025-03-09 06:55:01,040 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:55:01,040 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:00" (2/3) ... [2025-03-09 06:55:01,040 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74dfb8f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:55:01, skipping insertion in model container [2025-03-09 06:55:01,040 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:55:01,040 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:55:01" (3/3) ... [2025-03-09 06:55:01,041 INFO L363 chiAutomizerObserver]: Analyzing ICFG cll_traverse-alloca.i [2025-03-09 06:55:01,079 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 06:55:01,080 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 06:55:01,080 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 06:55:01,080 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 06:55:01,080 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 06:55:01,080 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 06:55:01,081 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 06:55:01,081 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 06:55:01,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:01,095 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-03-09 06:55:01,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:55:01,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:55:01,099 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:55:01,099 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 06:55:01,100 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 06:55:01,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:01,101 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-03-09 06:55:01,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:55:01,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:55:01,102 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:55:01,102 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 06:55:01,106 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~nondet6#1, main_#t~ret7#1.base, main_#t~ret7#1.offset, main_~n~0#1, main_~head~1#1.base, main_~head~1#1.offset;havoc main_#t~nondet6#1;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume { :begin_inline_init_cll } true;init_cll_#in~n#1 := main_~n~0#1;havoc init_cll_#res#1.base, init_cll_#res#1.offset;havoc init_cll_#t~malloc2#1.base, init_cll_#t~malloc2#1.offset, init_cll_#t~malloc3#1.base, init_cll_#t~malloc3#1.offset, init_cll_~next_node~0#1.base, init_cll_~next_node~0#1.offset, init_cll_#t~post4#1, init_cll_~i~0#1, init_cll_~n#1, init_cll_~head~0#1.base, init_cll_~head~0#1.offset, init_cll_~curr~0#1.base, init_cll_~curr~0#1.offset;init_cll_~n#1 := init_cll_#in~n#1;havoc init_cll_~head~0#1.base, init_cll_~head~0#1.offset;call init_cll_#t~malloc2#1.base, init_cll_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);init_cll_~curr~0#1.base, init_cll_~curr~0#1.offset := init_cll_#t~malloc2#1.base, init_cll_#t~malloc2#1.offset;havoc init_cll_#t~malloc2#1.base, init_cll_#t~malloc2#1.offset;call write~int#0(0, init_cll_~curr~0#1.base, init_cll_~curr~0#1.offset, 4);init_cll_~head~0#1.base, init_cll_~head~0#1.offset := init_cll_~curr~0#1.base, init_cll_~curr~0#1.offset;init_cll_~i~0#1 := 1;" [2025-03-09 06:55:01,106 INFO L754 eck$LassoCheckResult]: Loop: "assume init_cll_~i~0#1 < init_cll_~n#1;call init_cll_#t~malloc3#1.base, init_cll_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);init_cll_~next_node~0#1.base, init_cll_~next_node~0#1.offset := init_cll_#t~malloc3#1.base, init_cll_#t~malloc3#1.offset;havoc init_cll_#t~malloc3#1.base, init_cll_#t~malloc3#1.offset;call write~int#0(init_cll_~i~0#1, init_cll_~next_node~0#1.base, init_cll_~next_node~0#1.offset, 4);call write~$Pointer$#0(init_cll_~next_node~0#1.base, init_cll_~next_node~0#1.offset, init_cll_~curr~0#1.base, 4 + init_cll_~curr~0#1.offset, 8);init_cll_~curr~0#1.base, init_cll_~curr~0#1.offset := init_cll_~next_node~0#1.base, init_cll_~next_node~0#1.offset;havoc init_cll_~next_node~0#1.base, init_cll_~next_node~0#1.offset;init_cll_#t~post4#1 := init_cll_~i~0#1;init_cll_~i~0#1 := 1 + init_cll_#t~post4#1;havoc init_cll_#t~post4#1;" [2025-03-09 06:55:01,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:01,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1280, now seen corresponding path program 1 times [2025-03-09 06:55:01,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:01,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487398534] [2025-03-09 06:55:01,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:01,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:01,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:01,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:01,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:01,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:01,199 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:01,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:01,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:01,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:01,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:01,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:01,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:01,228 INFO L85 PathProgramCache]: Analyzing trace with hash 39, now seen corresponding path program 1 times [2025-03-09 06:55:01,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:01,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598345095] [2025-03-09 06:55:01,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:01,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:01,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:55:01,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:55:01,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:01,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:01,254 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:01,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:55:01,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:55:01,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:01,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:01,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:01,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:01,266 INFO L85 PathProgramCache]: Analyzing trace with hash 39688, now seen corresponding path program 1 times [2025-03-09 06:55:01,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:01,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920441336] [2025-03-09 06:55:01,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:01,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:01,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:55:01,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:55:01,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:01,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:01,316 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:01,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:55:01,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:55:01,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:01,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:01,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:02,025 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:55:02,026 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:55:02,026 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:55:02,026 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:55:02,026 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:55:02,026 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:02,026 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:55:02,027 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:55:02,027 INFO L132 ssoRankerPreferences]: Filename of dumped script: cll_traverse-alloca.i_Iteration1_Lasso [2025-03-09 06:55:02,027 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:55:02,027 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:55:02,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:02,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:02,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:02,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:02,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:02,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:02,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:02,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:02,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:02,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:02,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:02,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:02,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:02,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:02,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:02,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:02,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:02,354 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:55:02,357 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:55:02,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:02,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:02,360 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:02,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-09 06:55:02,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:02,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:02,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:02,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:02,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:02,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:02,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:02,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:02,380 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:02,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-09 06:55:02,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:02,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:02,389 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:02,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-09 06:55:02,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:02,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:02,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:02,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:02,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:02,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:02,403 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:02,403 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:02,405 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:02,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-09 06:55:02,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:02,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:02,413 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:02,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-09 06:55:02,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:02,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:02,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:02,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:02,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:02,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:02,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:02,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:02,429 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:02,435 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-09 06:55:02,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:02,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:02,437 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:02,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-09 06:55:02,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:02,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:02,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:02,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:02,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:02,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:02,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:02,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:02,452 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:02,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:02,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:02,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:02,460 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:02,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-09 06:55:02,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:02,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:02,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:02,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:02,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:02,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:02,474 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:02,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:02,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:02,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:02,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:02,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:02,483 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:02,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-09 06:55:02,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:02,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:02,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:02,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:02,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:02,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:02,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:02,497 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:02,503 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:02,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:02,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:02,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:02,510 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:02,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-09 06:55:02,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:02,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:02,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:02,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:02,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:02,534 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:02,535 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:02,539 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:02,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:02,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:02,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:02,547 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:02,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-09 06:55:02,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:02,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:02,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:02,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:02,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:02,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:02,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:02,582 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:02,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:02,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:02,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:02,590 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:02,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-09 06:55:02,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:02,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:02,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:02,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:02,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:02,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:02,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:02,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:02,606 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:02,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:02,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:02,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:02,614 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:02,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-09 06:55:02,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:02,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:02,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:02,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:02,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:02,630 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:02,630 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:02,634 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:02,640 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-09 06:55:02,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:02,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:02,642 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:02,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-09 06:55:02,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:02,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:02,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:02,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:02,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:02,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:02,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:02,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:02,656 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:02,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-09 06:55:02,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:02,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:02,664 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:02,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-09 06:55:02,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:02,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:02,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:02,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:02,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:02,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:02,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:02,682 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:02,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-09 06:55:02,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:02,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:02,693 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:02,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-09 06:55:02,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:02,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:02,708 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-09 06:55:02,708 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 06:55:02,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:02,714 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-03-09 06:55:02,714 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-09 06:55:02,726 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:02,734 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-09 06:55:02,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:02,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:02,736 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:02,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-09 06:55:02,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:02,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:02,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:02,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:02,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:02,753 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:02,753 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:02,758 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:55:02,770 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-03-09 06:55:02,772 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-09 06:55:02,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:02,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:02,776 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:02,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-09 06:55:02,779 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:55:02,792 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:55:02,792 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:55:02,793 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_cll_~i~0#1, ULTIMATE.start_init_cll_~n#1) = -1*ULTIMATE.start_init_cll_~i~0#1 + 1*ULTIMATE.start_init_cll_~n#1 Supporting invariants [] [2025-03-09 06:55:02,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-09 06:55:02,808 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-03-09 06:55:02,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:02,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:02,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:02,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:02,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:02,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:55:02,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:02,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:55:02,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:55:02,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:02,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:02,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:55:02,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:02,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:55:02,896 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-09 06:55:02,897 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:02,921 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 10 states and 12 transitions. Complement of second has 3 states. [2025-03-09 06:55:02,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:55:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:02,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-03-09 06:55:02,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 1 letters. [2025-03-09 06:55:02,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:02,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 3 letters. Loop has 1 letters. [2025-03-09 06:55:02,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:02,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 2 letters. [2025-03-09 06:55:02,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:02,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2025-03-09 06:55:02,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-09 06:55:02,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 6 states and 8 transitions. [2025-03-09 06:55:02,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-03-09 06:55:02,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-03-09 06:55:02,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 8 transitions. [2025-03-09 06:55:02,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:55:02,939 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6 states and 8 transitions. [2025-03-09 06:55:02,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 8 transitions. [2025-03-09 06:55:02,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2025-03-09 06:55:02,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:02,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2025-03-09 06:55:02,955 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6 states and 8 transitions. [2025-03-09 06:55:02,955 INFO L432 stractBuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2025-03-09 06:55:02,955 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 06:55:02,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2025-03-09 06:55:02,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-09 06:55:02,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:55:02,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:55:02,956 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 06:55:02,956 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 06:55:02,957 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~nondet6#1, main_#t~ret7#1.base, main_#t~ret7#1.offset, main_~n~0#1, main_~head~1#1.base, main_~head~1#1.offset;havoc main_#t~nondet6#1;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume { :begin_inline_init_cll } true;init_cll_#in~n#1 := main_~n~0#1;havoc init_cll_#res#1.base, init_cll_#res#1.offset;havoc init_cll_#t~malloc2#1.base, init_cll_#t~malloc2#1.offset, init_cll_#t~malloc3#1.base, init_cll_#t~malloc3#1.offset, init_cll_~next_node~0#1.base, init_cll_~next_node~0#1.offset, init_cll_#t~post4#1, init_cll_~i~0#1, init_cll_~n#1, init_cll_~head~0#1.base, init_cll_~head~0#1.offset, init_cll_~curr~0#1.base, init_cll_~curr~0#1.offset;init_cll_~n#1 := init_cll_#in~n#1;havoc init_cll_~head~0#1.base, init_cll_~head~0#1.offset;call init_cll_#t~malloc2#1.base, init_cll_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);init_cll_~curr~0#1.base, init_cll_~curr~0#1.offset := init_cll_#t~malloc2#1.base, init_cll_#t~malloc2#1.offset;havoc init_cll_#t~malloc2#1.base, init_cll_#t~malloc2#1.offset;call write~int#0(0, init_cll_~curr~0#1.base, init_cll_~curr~0#1.offset, 4);init_cll_~head~0#1.base, init_cll_~head~0#1.offset := init_cll_~curr~0#1.base, init_cll_~curr~0#1.offset;init_cll_~i~0#1 := 1;" "assume !(init_cll_~i~0#1 < init_cll_~n#1);havoc init_cll_~i~0#1;call write~$Pointer$#0(init_cll_~head~0#1.base, init_cll_~head~0#1.offset, init_cll_~curr~0#1.base, 4 + init_cll_~curr~0#1.offset, 8);init_cll_#res#1.base, init_cll_#res#1.offset := init_cll_~head~0#1.base, init_cll_~head~0#1.offset;" "main_#t~ret7#1.base, main_#t~ret7#1.offset := init_cll_#res#1.base, init_cll_#res#1.offset;havoc init_cll_#t~malloc2#1.base, init_cll_#t~malloc2#1.offset, init_cll_#t~malloc3#1.base, init_cll_#t~malloc3#1.offset, init_cll_~next_node~0#1.base, init_cll_~next_node~0#1.offset, init_cll_#t~post4#1, init_cll_~i~0#1, init_cll_~n#1, init_cll_~head~0#1.base, init_cll_~head~0#1.offset, init_cll_~curr~0#1.base, init_cll_~curr~0#1.offset;havoc init_cll_#in~n#1;assume { :end_inline_init_cll } true;main_~head~1#1.base, main_~head~1#1.offset := main_#t~ret7#1.base, main_#t~ret7#1.offset;havoc main_#t~ret7#1.base, main_#t~ret7#1.offset;assume { :begin_inline_traverse } true;traverse_#in~head#1.base, traverse_#in~head#1.offset := main_~head~1#1.base, main_~head~1#1.offset;havoc traverse_#t~mem5#1.base, traverse_#t~mem5#1.offset, traverse_~head#1.base, traverse_~head#1.offset, traverse_~curr~1#1.base, traverse_~curr~1#1.offset;traverse_~head#1.base, traverse_~head#1.offset := traverse_#in~head#1.base, traverse_#in~head#1.offset;traverse_~curr~1#1.base, traverse_~curr~1#1.offset := traverse_~head#1.base, traverse_~head#1.offset;" [2025-03-09 06:55:02,957 INFO L754 eck$LassoCheckResult]: Loop: "assume traverse_~curr~1#1.base != 0 || traverse_~curr~1#1.offset != 0;call traverse_#t~mem5#1.base, traverse_#t~mem5#1.offset := read~$Pointer$#0(traverse_~curr~1#1.base, 4 + traverse_~curr~1#1.offset, 8);traverse_~curr~1#1.base, traverse_~curr~1#1.offset := traverse_#t~mem5#1.base, traverse_#t~mem5#1.offset;havoc traverse_#t~mem5#1.base, traverse_#t~mem5#1.offset;" [2025-03-09 06:55:02,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:02,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1230302, now seen corresponding path program 1 times [2025-03-09 06:55:02,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:02,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86467812] [2025-03-09 06:55:02,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:02,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:02,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:55:02,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:55:02,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:02,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:02,975 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:02,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:55:02,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:55:02,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:02,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:02,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:02,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:02,994 INFO L85 PathProgramCache]: Analyzing trace with hash 34, now seen corresponding path program 1 times [2025-03-09 06:55:02,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:02,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579349331] [2025-03-09 06:55:02,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:02,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:02,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:55:02,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:55:02,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:02,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:02,999 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:03,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:55:03,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:55:03,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:03,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:03,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:03,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:03,002 INFO L85 PathProgramCache]: Analyzing trace with hash 38139365, now seen corresponding path program 1 times [2025-03-09 06:55:03,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:03,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126133933] [2025-03-09 06:55:03,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:03,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:03,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:55:03,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:55:03,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:03,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:03,023 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:03,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:55:03,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:55:03,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:03,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:03,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:03,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-09 06:55:03,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:55:03,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:55:03,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:03,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:03,426 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:03,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:55:03,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:55:03,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:03,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:03,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 06:55:03 BoogieIcfgContainer [2025-03-09 06:55:03,462 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 06:55:03,462 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 06:55:03,462 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 06:55:03,463 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 06:55:03,463 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:55:01" (3/4) ... [2025-03-09 06:55:03,464 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-09 06:55:03,485 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 06:55:03,486 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 06:55:03,486 INFO L158 Benchmark]: Toolchain (without parser) took 2966.02ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 96.9MB in the end (delta: 15.8MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2025-03-09 06:55:03,486 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:55:03,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.09ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 96.3MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 06:55:03,487 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.68ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 94.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:55:03,487 INFO L158 Benchmark]: Boogie Preprocessor took 19.24ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 93.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:55:03,487 INFO L158 Benchmark]: IcfgBuilder took 225.78ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 81.0MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 06:55:03,487 INFO L158 Benchmark]: BuchiAutomizer took 2427.55ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 100.4MB in the end (delta: -19.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:55:03,487 INFO L158 Benchmark]: Witness Printer took 23.24ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 96.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:55:03,488 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.17ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.09ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 96.3MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.68ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 94.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.24ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 93.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 225.78ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 81.0MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 2427.55ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 100.4MB in the end (delta: -19.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 23.24ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 96.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (n + ((long) -1 * i)) and consists of 2 locations. The remainder module has 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 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, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 2 mSDtfsCounter, 4 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital254 mio100 ax100 hnf100 lsp98 ukn30 mio100 lsp33 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf151 smp85 tf100 neg100 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 564]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L570] int n = __VERIFIER_nondet_int(); [L571] CALL, EXPR init_cll(n) [L548] node_t* head; [L549] node_t* curr = malloc(sizeof(node_t)); [L550] curr->val = 0 [L551] head = curr [L552] int i = 1; VAL [curr={17227:0}, head={17227:0}, i=1, n=0] [L552] COND FALSE !(i < n) [L558] curr->next = head [L559] return head; VAL [\result={17227:0}] [L571] RET, EXPR init_cll(n) [L571] node_t* head = init_cll(n); [L572] CALL traverse(head) [L563] node_t* curr = head; VAL [curr={17227:0}] Loop: [L564] COND TRUE curr != ((void *)0) [L565] EXPR curr->next [L565] curr = curr->next End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 564]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L570] int n = __VERIFIER_nondet_int(); [L571] CALL, EXPR init_cll(n) [L548] node_t* head; [L549] node_t* curr = malloc(sizeof(node_t)); [L550] curr->val = 0 [L551] head = curr [L552] int i = 1; VAL [curr={17227:0}, head={17227:0}, i=1, n=0] [L552] COND FALSE !(i < n) [L558] curr->next = head [L559] return head; VAL [\result={17227:0}] [L571] RET, EXPR init_cll(n) [L571] node_t* head = init_cll(n); [L572] CALL traverse(head) [L563] node_t* curr = head; VAL [curr={17227:0}] Loop: [L564] COND TRUE curr != ((void *)0) [L565] EXPR curr->next [L565] curr = curr->next End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-09 06:55:03,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)