./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/ll_append-alloca-2.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 a94e514ac338898e2e1e54a42b19ae4490ac5c412319209fc14736a6de9b7386 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:26:18,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:26:18,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-09 15:26:18,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:26:18,731 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:26:18,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:26:18,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:26:18,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:26:18,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:26:18,774 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:26:18,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:26:18,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:26:18,775 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:26:18,776 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:26:18,776 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:26:18,776 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:26:18,777 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:26:18,777 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:26:18,777 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:26:18,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:26:18,778 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:26:18,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:26:18,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:26:18,784 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:26:18,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:26:18,784 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:26:18,784 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:26:18,784 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:26:18,785 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:26:18,785 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:26:18,785 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:26:18,785 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:26:18,786 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:26:18,786 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:26:18,786 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:26:18,786 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:26:18,787 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> a94e514ac338898e2e1e54a42b19ae4490ac5c412319209fc14736a6de9b7386 [2024-11-09 15:26:19,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:26:19,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:26:19,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:26:19,066 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:26:19,068 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:26:19,069 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i [2024-11-09 15:26:20,512 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:26:20,725 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:26:20,726 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i [2024-11-09 15:26:20,741 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c95edf8ef/134f3a000d1048389827e1e4cc063985/FLAGbd4053b46 [2024-11-09 15:26:20,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c95edf8ef/134f3a000d1048389827e1e4cc063985 [2024-11-09 15:26:20,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:26:20,765 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:26:20,766 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:26:20,768 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:26:20,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:26:20,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:26:20" (1/1) ... [2024-11-09 15:26:20,775 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@481acf13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:20, skipping insertion in model container [2024-11-09 15:26:20,775 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:26:20" (1/1) ... [2024-11-09 15:26:20,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:26:21,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:26:21,167 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:26:21,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:26:21,256 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:26:21,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:21 WrapperNode [2024-11-09 15:26:21,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:26:21,258 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:26:21,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:26:21,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:26:21,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:21" (1/1) ... [2024-11-09 15:26:21,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:21" (1/1) ... [2024-11-09 15:26:21,305 INFO L138 Inliner]: procedures = 115, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2024-11-09 15:26:21,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:26:21,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:26:21,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:26:21,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:26:21,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:21" (1/1) ... [2024-11-09 15:26:21,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:21" (1/1) ... [2024-11-09 15:26:21,322 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:21" (1/1) ... [2024-11-09 15:26:21,343 INFO L175 MemorySlicer]: Split 6 memory accesses to 1 slices as follows [6]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2024-11-09 15:26:21,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:21" (1/1) ... [2024-11-09 15:26:21,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:21" (1/1) ... [2024-11-09 15:26:21,349 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:21" (1/1) ... [2024-11-09 15:26:21,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:21" (1/1) ... [2024-11-09 15:26:21,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:21" (1/1) ... [2024-11-09 15:26:21,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:21" (1/1) ... [2024-11-09 15:26:21,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:26:21,372 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:26:21,372 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:26:21,372 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:26:21,373 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:21" (1/1) ... [2024-11-09 15:26:21,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:21,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:21,408 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) [2024-11-09 15:26:21,411 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 [2024-11-09 15:26:21,452 INFO L130 BoogieDeclarations]: Found specification of procedure new_ll [2024-11-09 15:26:21,452 INFO L138 BoogieDeclarations]: Found implementation of procedure new_ll [2024-11-09 15:26:21,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 15:26:21,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 15:26:21,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 15:26:21,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 15:26:21,453 INFO L130 BoogieDeclarations]: Found specification of procedure length [2024-11-09 15:26:21,453 INFO L138 BoogieDeclarations]: Found implementation of procedure length [2024-11-09 15:26:21,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:26:21,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:26:21,564 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:26:21,566 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:26:21,759 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-09 15:26:21,759 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:26:21,777 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:26:21,777 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 15:26:21,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:26:21 BoogieIcfgContainer [2024-11-09 15:26:21,778 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:26:21,780 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:26:21,780 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:26:21,784 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:26:21,785 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:26:21,785 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:26:20" (1/3) ... [2024-11-09 15:26:21,786 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cdec59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:26:21, skipping insertion in model container [2024-11-09 15:26:21,787 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:26:21,787 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:21" (2/3) ... [2024-11-09 15:26:21,787 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cdec59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:26:21, skipping insertion in model container [2024-11-09 15:26:21,788 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:26:21,789 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:26:21" (3/3) ... [2024-11-09 15:26:21,790 INFO L332 chiAutomizerObserver]: Analyzing ICFG ll_append-alloca-2.i [2024-11-09 15:26:21,846 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:26:21,846 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:26:21,846 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:26:21,846 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:26:21,847 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:26:21,847 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:26:21,847 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:26:21,847 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:26:21,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 15:26:21,868 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2024-11-09 15:26:21,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:26:21,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:26:21,874 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-09 15:26:21,875 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:26:21,875 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:26:21,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 15:26:21,878 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2024-11-09 15:26:21,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:26:21,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:26:21,879 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-09 15:26:21,879 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:26:21,888 INFO L745 eck$LassoCheckResult]: Stem: 22#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 12#L574true assume !(main_~n~0#1 < 1); 26#L577true call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 9#$Ultimate##0true [2024-11-09 15:26:21,889 INFO L747 eck$LassoCheckResult]: Loop: 9#$Ultimate##0true ~n := #in~n; 18#L548true assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int#0(~n, ~head~0.base, ~head~0.offset, 4); 13#L552true call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 9#$Ultimate##0true [2024-11-09 15:26:21,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:21,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1418244, now seen corresponding path program 1 times [2024-11-09 15:26:21,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:21,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441093455] [2024-11-09 15:26:21,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:21,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:22,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:22,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:22,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:22,053 INFO L85 PathProgramCache]: Analyzing trace with hash 29967, now seen corresponding path program 1 times [2024-11-09 15:26:22,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:22,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650966824] [2024-11-09 15:26:22,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:22,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:22,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:22,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:22,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:22,119 INFO L85 PathProgramCache]: Analyzing trace with hash -698765780, now seen corresponding path program 1 times [2024-11-09 15:26:22,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:22,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131202634] [2024-11-09 15:26:22,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:22,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:22,148 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:22,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:23,013 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:26:23,015 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:26:23,015 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:26:23,015 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:26:23,015 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:26:23,015 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:23,016 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:26:23,016 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:26:23,016 INFO L132 ssoRankerPreferences]: Filename of dumped script: ll_append-alloca-2.i_Iteration1_Lasso [2024-11-09 15:26:23,020 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:26:23,020 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:26:23,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:23,436 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:26:23,443 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:26:23,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:23,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:23,448 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) [2024-11-09 15:26:23,450 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 [2024-11-09 15:26:23,452 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 [2024-11-09 15:26:23,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:23,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:23,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:23,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:23,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:23,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:23,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:23,472 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:23,483 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 [2024-11-09 15:26:23,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:23,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:23,485 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) [2024-11-09 15:26:23,486 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 [2024-11-09 15:26:23,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 [2024-11-09 15:26:23,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:23,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:23,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:23,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:23,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:23,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:23,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:23,503 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:23,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-09 15:26:23,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:23,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:23,524 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) [2024-11-09 15:26:23,527 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 [2024-11-09 15:26:23,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:26:23,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:23,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:23,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:23,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:23,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:23,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:23,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:23,548 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:23,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-09 15:26:23,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:23,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:23,568 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) [2024-11-09 15:26:23,569 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 [2024-11-09 15:26:23,572 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 [2024-11-09 15:26:23,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:23,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:23,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:23,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:23,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:23,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:23,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:23,589 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:23,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-09 15:26:23,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:23,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:23,606 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) [2024-11-09 15:26:23,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:26:23,613 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 [2024-11-09 15:26:23,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:23,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:23,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:23,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:23,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:23,622 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:23,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:23,624 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:23,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-09 15:26:23,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:23,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:23,641 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) [2024-11-09 15:26:23,642 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 [2024-11-09 15:26:23,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 [2024-11-09 15:26:23,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:23,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:23,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:23,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:23,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:23,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:23,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:23,659 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:23,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-09 15:26:23,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:23,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:23,677 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) [2024-11-09 15:26:23,681 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 [2024-11-09 15:26:23,683 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 [2024-11-09 15:26:23,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:23,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:23,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:23,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:23,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:23,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:23,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:23,698 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:23,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-09 15:26:23,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:23,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:23,712 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) [2024-11-09 15:26:23,713 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 [2024-11-09 15:26:23,714 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 [2024-11-09 15:26:23,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:23,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:23,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:23,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:23,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:23,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:23,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:23,727 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:23,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-09 15:26:23,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:23,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:23,739 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) [2024-11-09 15:26:23,739 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 [2024-11-09 15:26:23,740 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 [2024-11-09 15:26:23,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:23,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:23,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:23,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:23,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:23,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:23,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:23,756 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:23,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-09 15:26:23,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:23,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:23,775 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) [2024-11-09 15:26:23,777 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 [2024-11-09 15:26:23,778 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 [2024-11-09 15:26:23,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:23,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:23,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:23,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:23,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:23,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:23,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:23,794 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:23,809 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 [2024-11-09 15:26:23,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:23,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:23,812 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) [2024-11-09 15:26:23,815 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 [2024-11-09 15:26:23,816 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 [2024-11-09 15:26:23,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:23,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:23,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:23,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:23,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:23,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:23,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:23,834 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:23,848 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 [2024-11-09 15:26:23,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:23,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:23,852 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) [2024-11-09 15:26:23,853 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 [2024-11-09 15:26:23,855 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 [2024-11-09 15:26:23,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:23,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:23,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:23,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:23,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:23,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:23,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:23,873 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:23,888 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 [2024-11-09 15:26:23,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:23,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:23,890 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) [2024-11-09 15:26:23,891 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 [2024-11-09 15:26:23,892 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 [2024-11-09 15:26:23,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:23,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:23,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:23,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:23,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:23,906 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:23,906 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:23,910 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:23,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-09 15:26:23,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:23,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:23,923 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) [2024-11-09 15:26:23,924 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 [2024-11-09 15:26:23,925 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 [2024-11-09 15:26:23,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:23,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:23,935 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-09 15:26:23,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:23,942 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-09 15:26:23,942 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-09 15:26:23,954 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:26:23,986 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-09 15:26:23,987 INFO L444 ModelExtractionUtils]: 1 out of 11 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-09 15:26:23,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:23,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:23,992 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) [2024-11-09 15:26:23,995 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:26:23,998 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 [2024-11-09 15:26:24,012 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-11-09 15:26:24,013 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:26:24,014 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(new_ll_#in~n) = 1*new_ll_#in~n Supporting invariants [1*new_ll_#in~n >= 0] [2024-11-09 15:26:24,029 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 [2024-11-09 15:26:24,039 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-11-09 15:26:24,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:24,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:26:24,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:24,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:26:24,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:24,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:24,228 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-11-09 15:26:24,230 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:26:24,351 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4). Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 45 states and 54 transitions. Complement of second has 17 states. [2024-11-09 15:26:24,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-09 15:26:24,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:26:24,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2024-11-09 15:26:24,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2024-11-09 15:26:24,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:26:24,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2024-11-09 15:26:24,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:26:24,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2024-11-09 15:26:24,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:26:24,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2024-11-09 15:26:24,365 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-09 15:26:24,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 29 states and 37 transitions. [2024-11-09 15:26:24,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-09 15:26:24,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-09 15:26:24,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2024-11-09 15:26:24,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:26:24,376 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-09 15:26:24,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2024-11-09 15:26:24,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-11-09 15:26:24,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 15:26:24,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-09 15:26:24,399 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-09 15:26:24,400 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-09 15:26:24,401 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:26:24,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2024-11-09 15:26:24,402 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-09 15:26:24,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:26:24,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:26:24,403 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:26:24,403 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:26:24,403 INFO L745 eck$LassoCheckResult]: Stem: 168#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 156#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 157#L574 assume !(main_~n~0#1 < 1); 145#L577 call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 160#$Ultimate##0 ~n := #in~n; 161#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 169#new_llFINAL assume true; 167#new_llEXIT >#57#return; 163#L577-1 main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset; 164#L563 assume !(append_~x#1.base == 0 && append_~x#1.offset == 0);append_~s~0#1.base, append_~s~0#1.offset := append_~x#1.base, append_~x#1.offset; 166#L566-3 [2024-11-09 15:26:24,404 INFO L747 eck$LassoCheckResult]: Loop: 166#L566-3 call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#0(append_~x#1.base, 4 + append_~x#1.offset, 8); 165#L566-1 assume !!(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$#0(append_~x#1.base, 4 + append_~x#1.offset, 8);append_~x#1.base, append_~x#1.offset := append_#t~mem7#1.base, append_#t~mem7#1.offset; 166#L566-3 [2024-11-09 15:26:24,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:24,404 INFO L85 PathProgramCache]: Analyzing trace with hash 772923198, now seen corresponding path program 1 times [2024-11-09 15:26:24,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:24,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636490584] [2024-11-09 15:26:24,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:24,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:24,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 15:26:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:24,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:24,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:26:24,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636490584] [2024-11-09 15:26:24,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636490584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:26:24,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:26:24,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 15:26:24,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948488367] [2024-11-09 15:26:24,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:26:24,635 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:26:24,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:24,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2086, now seen corresponding path program 1 times [2024-11-09 15:26:24,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:24,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639443031] [2024-11-09 15:26:24,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:24,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:24,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:24,651 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 [2024-11-09 15:26:24,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:24,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:26:24,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 15:26:24,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 15:26:24,724 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 15:26:24,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:26:24,806 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2024-11-09 15:26:24,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2024-11-09 15:26:24,807 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-09 15:26:24,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 34 transitions. [2024-11-09 15:26:24,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-09 15:26:24,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-11-09 15:26:24,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 34 transitions. [2024-11-09 15:26:24,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:26:24,811 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-09 15:26:24,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 34 transitions. [2024-11-09 15:26:24,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-09 15:26:24,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 15:26:24,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-11-09 15:26:24,817 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-09 15:26:24,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 15:26:24,818 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-09 15:26:24,818 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:26:24,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 34 transitions. [2024-11-09 15:26:24,819 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-09 15:26:24,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:26:24,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:26:24,821 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:26:24,821 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:26:24,821 INFO L745 eck$LassoCheckResult]: Stem: 239#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 227#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 228#L574 assume !(main_~n~0#1 < 1); 217#L577 call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 231#$Ultimate##0 ~n := #in~n; 232#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 243#new_llFINAL assume true; 236#new_llEXIT >#57#return; 234#L577-1 main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset; 235#L563 assume append_~x#1.base == 0 && append_~x#1.offset == 0;append_#res#1.base, append_#res#1.offset := append_~y#1.base, append_~y#1.offset; 220#append_returnLabel#1 main_#t~ret10#1.base, main_#t~ret10#1.offset := append_#res#1.base, append_#res#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;havoc append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset;assume { :end_inline_append } true;main_~y~0#1.base, main_~y~0#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset; 223#L579 call main_#t~ret11#1 := length(main_~y~0#1.base, main_~y~0#1.offset);< 230#$Ultimate##0 [2024-11-09 15:26:24,822 INFO L747 eck$LassoCheckResult]: Loop: 230#$Ultimate##0 ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 221#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$#0(~xs.base, 4 + ~xs.offset, 8); 222#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 230#$Ultimate##0 [2024-11-09 15:26:24,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:24,822 INFO L85 PathProgramCache]: Analyzing trace with hash -250149368, now seen corresponding path program 1 times [2024-11-09 15:26:24,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:24,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686539833] [2024-11-09 15:26:24,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:24,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:24,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 15:26:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:24,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:24,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:26:24,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686539833] [2024-11-09 15:26:24,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686539833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:26:24,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:26:24,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 15:26:24,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980644164] [2024-11-09 15:26:24,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:26:24,915 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:26:24,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:24,915 INFO L85 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 1 times [2024-11-09 15:26:24,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:24,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926920324] [2024-11-09 15:26:24,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:24,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:24,923 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:24,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:25,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:26:25,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 15:26:25,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 15:26:25,045 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. cyclomatic complexity: 8 Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 15:26:25,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:26:25,129 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-11-09 15:26:25,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2024-11-09 15:26:25,130 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-09 15:26:25,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 28 transitions. [2024-11-09 15:26:25,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-09 15:26:25,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-09 15:26:25,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2024-11-09 15:26:25,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:26:25,131 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-09 15:26:25,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2024-11-09 15:26:25,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-09 15:26:25,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 15:26:25,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-09 15:26:25,134 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-09 15:26:25,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 15:26:25,136 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-09 15:26:25,137 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:26:25,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2024-11-09 15:26:25,137 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-09 15:26:25,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:26:25,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:26:25,138 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:26:25,138 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:26:25,138 INFO L745 eck$LassoCheckResult]: Stem: 308#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 300#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 301#L574 assume !(main_~n~0#1 < 1); 289#L577 call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 304#$Ultimate##0 ~n := #in~n; 299#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int#0(~n, ~head~0.base, ~head~0.offset, 4); 290#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 305#$Ultimate##0 ~n := #in~n; 297#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 298#new_llFINAL assume true; 302#new_llEXIT >#53#return; 288#L552-1 call write~$Pointer$#0(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 291#new_llFINAL assume true; 311#new_llEXIT >#57#return; 306#L577-1 main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset; 307#L563 assume !(append_~x#1.base == 0 && append_~x#1.offset == 0);append_~s~0#1.base, append_~s~0#1.offset := append_~x#1.base, append_~x#1.offset; 309#L566-3 [2024-11-09 15:26:25,138 INFO L747 eck$LassoCheckResult]: Loop: 309#L566-3 call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#0(append_~x#1.base, 4 + append_~x#1.offset, 8); 310#L566-1 assume !!(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$#0(append_~x#1.base, 4 + append_~x#1.offset, 8);append_~x#1.base, append_~x#1.offset := append_#t~mem7#1.base, append_#t~mem7#1.offset; 309#L566-3 [2024-11-09 15:26:25,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:25,139 INFO L85 PathProgramCache]: Analyzing trace with hash 704779872, now seen corresponding path program 1 times [2024-11-09 15:26:25,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:25,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227112718] [2024-11-09 15:26:25,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:25,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:25,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:25,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:25,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:25,182 INFO L85 PathProgramCache]: Analyzing trace with hash 2086, now seen corresponding path program 2 times [2024-11-09 15:26:25,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:25,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432850649] [2024-11-09 15:26:25,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:25,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:25,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:25,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:25,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:25,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1311374651, now seen corresponding path program 1 times [2024-11-09 15:26:25,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:25,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698256598] [2024-11-09 15:26:25,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:25,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:25,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 15:26:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:25,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 15:26:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:25,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 15:26:25,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:26:25,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698256598] [2024-11-09 15:26:25,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698256598] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:26:25,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142730736] [2024-11-09 15:26:25,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:25,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:26:25,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:25,754 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:26:25,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-09 15:26:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:25,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 15:26:25,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:25,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 15:26:25,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 15:26:25,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 15:26:25,931 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:26:26,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 15:26:26,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142730736] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:26:26,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:26:26,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 10 [2024-11-09 15:26:26,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040666835] [2024-11-09 15:26:26,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:26:26,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:26:26,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 15:26:26,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 15:26:26,120 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. cyclomatic complexity: 7 Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 15:26:26,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:26:26,314 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-09 15:26:26,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 38 transitions. [2024-11-09 15:26:26,315 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-09 15:26:26,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 38 transitions. [2024-11-09 15:26:26,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-11-09 15:26:26,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-11-09 15:26:26,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 38 transitions. [2024-11-09 15:26:26,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:26:26,322 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-09 15:26:26,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 38 transitions. [2024-11-09 15:26:26,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-11-09 15:26:26,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 15:26:26,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-09 15:26:26,325 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-09 15:26:26,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 15:26:26,327 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-09 15:26:26,327 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:26:26,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2024-11-09 15:26:26,328 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-09 15:26:26,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:26:26,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:26:26,332 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:26:26,332 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:26:26,332 INFO L745 eck$LassoCheckResult]: Stem: 508#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 498#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 499#L574 assume !(main_~n~0#1 < 1); 488#L577 call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 502#$Ultimate##0 ~n := #in~n; 497#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int#0(~n, ~head~0.base, ~head~0.offset, 4); 487#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 503#$Ultimate##0 ~n := #in~n; 495#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 496#new_llFINAL assume true; 500#new_llEXIT >#53#return; 486#L552-1 call write~$Pointer$#0(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 489#new_llFINAL assume true; 516#new_llEXIT >#57#return; 504#L577-1 main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset; 505#L563 assume append_~x#1.base == 0 && append_~x#1.offset == 0;append_#res#1.base, append_#res#1.offset := append_~y#1.base, append_~y#1.offset; 491#append_returnLabel#1 main_#t~ret10#1.base, main_#t~ret10#1.offset := append_#res#1.base, append_#res#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;havoc append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset;assume { :end_inline_append } true;main_~y~0#1.base, main_~y~0#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset; 494#L579 call main_#t~ret11#1 := length(main_~y~0#1.base, main_~y~0#1.offset);< 501#$Ultimate##0 [2024-11-09 15:26:26,332 INFO L747 eck$LassoCheckResult]: Loop: 501#$Ultimate##0 ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 492#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$#0(~xs.base, 4 + ~xs.offset, 8); 493#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 501#$Ultimate##0 [2024-11-09 15:26:26,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:26,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1311376214, now seen corresponding path program 1 times [2024-11-09 15:26:26,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:26,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250142578] [2024-11-09 15:26:26,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:26,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:26,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 15:26:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:26,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 15:26:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:26,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 15:26:26,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:26:26,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250142578] [2024-11-09 15:26:26,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250142578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:26:26,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:26:26,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 15:26:26,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593520880] [2024-11-09 15:26:26,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:26:26,468 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:26:26,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:26,468 INFO L85 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 2 times [2024-11-09 15:26:26,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:26,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134810610] [2024-11-09 15:26:26,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:26,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:26,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:26,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:26,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:26:26,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 15:26:26,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 15:26:26,581 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 15:26:26,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:26:26,631 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-11-09 15:26:26,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 39 transitions. [2024-11-09 15:26:26,633 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-09 15:26:26,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 39 transitions. [2024-11-09 15:26:26,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-09 15:26:26,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-11-09 15:26:26,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 39 transitions. [2024-11-09 15:26:26,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:26:26,634 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-11-09 15:26:26,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 39 transitions. [2024-11-09 15:26:26,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2024-11-09 15:26:26,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 15:26:26,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-09 15:26:26,638 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-09 15:26:26,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 15:26:26,639 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-09 15:26:26,639 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:26:26,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2024-11-09 15:26:26,640 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-09 15:26:26,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:26:26,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:26:26,641 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:26:26,641 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:26:26,642 INFO L745 eck$LassoCheckResult]: Stem: 595#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 587#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 588#L574 assume !(main_~n~0#1 < 1); 576#L577 call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 591#$Ultimate##0 ~n := #in~n; 586#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int#0(~n, ~head~0.base, ~head~0.offset, 4); 577#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 592#$Ultimate##0 ~n := #in~n; 584#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 585#new_llFINAL assume true; 596#new_llEXIT >#53#return; 597#L552-1 call write~$Pointer$#0(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 605#new_llFINAL assume true; 602#new_llEXIT >#57#return; 593#L577-1 main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset; 594#L563 assume !(append_~x#1.base == 0 && append_~x#1.offset == 0);append_~s~0#1.base, append_~s~0#1.offset := append_~x#1.base, append_~x#1.offset; 603#L566-3 call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#0(append_~x#1.base, 4 + append_~x#1.offset, 8); 600#L566-1 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset; 579#L566-4 call write~$Pointer$#0(append_~y#1.base, append_~y#1.offset, append_~x#1.base, 4 + append_~x#1.offset, 8);append_#res#1.base, append_#res#1.offset := append_~s~0#1.base, append_~s~0#1.offset; 580#append_returnLabel#1 main_#t~ret10#1.base, main_#t~ret10#1.offset := append_#res#1.base, append_#res#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;havoc append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset;assume { :end_inline_append } true;main_~y~0#1.base, main_~y~0#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset; 583#L579 call main_#t~ret11#1 := length(main_~y~0#1.base, main_~y~0#1.offset);< 590#$Ultimate##0 [2024-11-09 15:26:26,642 INFO L747 eck$LassoCheckResult]: Loop: 590#$Ultimate##0 ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 581#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$#0(~xs.base, 4 + ~xs.offset, 8); 582#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 590#$Ultimate##0 [2024-11-09 15:26:26,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:26,642 INFO L85 PathProgramCache]: Analyzing trace with hash -139719339, now seen corresponding path program 1 times [2024-11-09 15:26:26,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:26,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041333641] [2024-11-09 15:26:26,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:26,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:26,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:26,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:26,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:26,679 INFO L85 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 3 times [2024-11-09 15:26:26,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:26,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844731804] [2024-11-09 15:26:26,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:26,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:26,682 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:26,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:26,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:26,685 INFO L85 PathProgramCache]: Analyzing trace with hash -555510211, now seen corresponding path program 1 times [2024-11-09 15:26:26,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:26,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645867662] [2024-11-09 15:26:26,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:26,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:26,702 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:26,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:28,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:28,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:26:28 BoogieIcfgContainer [2024-11-09 15:26:28,117 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:26:28,117 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:26:28,117 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:26:28,117 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:26:28,118 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:26:21" (3/4) ... [2024-11-09 15:26:28,120 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-09 15:26:28,166 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 15:26:28,167 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:26:28,167 INFO L158 Benchmark]: Toolchain (without parser) took 7402.29ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 71.6MB in the beginning and 115.9MB in the end (delta: -44.3MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2024-11-09 15:26:28,167 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 142.6MB. Free memory is still 106.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:26:28,168 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.76ms. Allocated memory is still 142.6MB. Free memory was 71.3MB in the beginning and 52.7MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 15:26:28,168 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.71ms. Allocated memory is still 142.6MB. Free memory was 52.7MB in the beginning and 51.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:26:28,168 INFO L158 Benchmark]: Boogie Preprocessor took 63.16ms. Allocated memory is still 142.6MB. Free memory was 51.0MB in the beginning and 48.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:26:28,168 INFO L158 Benchmark]: RCFGBuilder took 407.31ms. Allocated memory was 142.6MB in the beginning and 180.4MB in the end (delta: 37.7MB). Free memory was 48.5MB in the beginning and 142.2MB in the end (delta: -93.7MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-11-09 15:26:28,169 INFO L158 Benchmark]: BuchiAutomizer took 6337.03ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 142.2MB in the beginning and 118.0MB in the end (delta: 24.3MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. [2024-11-09 15:26:28,169 INFO L158 Benchmark]: Witness Printer took 49.52ms. Allocated memory is still 218.1MB. Free memory was 118.0MB in the beginning and 115.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:26:28,170 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 142.6MB. Free memory is still 106.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 490.76ms. Allocated memory is still 142.6MB. Free memory was 71.3MB in the beginning and 52.7MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.71ms. Allocated memory is still 142.6MB. Free memory was 52.7MB in the beginning and 51.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.16ms. Allocated memory is still 142.6MB. Free memory was 51.0MB in the beginning and 48.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 407.31ms. Allocated memory was 142.6MB in the beginning and 180.4MB in the end (delta: 37.7MB). Free memory was 48.5MB in the beginning and 142.2MB in the end (delta: -93.7MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 6337.03ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 142.2MB in the beginning and 118.0MB in the end (delta: 24.3MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. * Witness Printer took 49.52ms. Allocated memory is still 218.1MB. Free memory was 118.0MB in the beginning and 115.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(n) and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. The remainder module has 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 293 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 222 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 302 IncrementalHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 71 mSDtfsCounter, 302 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital138 mio100 ax100 hnf100 lsp100 ukn31 mio100 lsp39 div100 bol100 ite100 ukn100 eq217 hnf86 smp100 dnf112 smp100 tf100 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 91ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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: 555]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L573] int n = __VERIFIER_nondet_int(); [L574] COND FALSE !(n < 1) VAL [n=1] [L577] CALL, EXPR new_ll(n) VAL [\old(n)=1] [L548] COND FALSE !(n == 0) [L550] node_t* head = malloc(sizeof(node_t)); [L551] head->val = n VAL [\old(n)=1, head={-1:0}, n=1] [L552] CALL, EXPR new_ll(n-1) VAL [\old(n)=0] [L548] COND TRUE n == 0 [L549] return ((void *)0); VAL [\old(n)=0, \result={0:0}] [L552] RET, EXPR new_ll(n-1) VAL [\old(n)=1, head={-1:0}, n=1] [L552] head->next = new_ll(n-1) [L553] return head; VAL [\old(n)=1, \result={-1:0}, n=1] [L577] RET, EXPR new_ll(n) VAL [n=1] [L577] node_t* x = new_ll(n); [L578] CALL, EXPR append(x, x) [L563] COND FALSE !(x == ((void *)0)) [L565] node_t* s = x; VAL [s={-1:0}, x={-1:0}, y={-1:0}] [L566] EXPR x->next [L566] COND FALSE !(x->next != ((void *)0)) [L568] x->next = y [L569] return s; VAL [\result={-1:0}] [L578] RET, EXPR append(x, x) [L578] node_t* y = append(x, x); [L579] CALL length(y) VAL [\old(xs)={-1:0}] Loop: [L557] COND FALSE !(xs == ((void *)0)) [L559] EXPR xs->next [L559] CALL length(xs->next) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 555]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L573] int n = __VERIFIER_nondet_int(); [L574] COND FALSE !(n < 1) VAL [n=1] [L577] CALL, EXPR new_ll(n) VAL [\old(n)=1] [L548] COND FALSE !(n == 0) [L550] node_t* head = malloc(sizeof(node_t)); [L551] head->val = n VAL [\old(n)=1, head={-1:0}, n=1] [L552] CALL, EXPR new_ll(n-1) VAL [\old(n)=0] [L548] COND TRUE n == 0 [L549] return ((void *)0); VAL [\old(n)=0, \result={0:0}] [L552] RET, EXPR new_ll(n-1) VAL [\old(n)=1, head={-1:0}, n=1] [L552] head->next = new_ll(n-1) [L553] return head; VAL [\old(n)=1, \result={-1:0}, n=1] [L577] RET, EXPR new_ll(n) VAL [n=1] [L577] node_t* x = new_ll(n); [L578] CALL, EXPR append(x, x) [L563] COND FALSE !(x == ((void *)0)) [L565] node_t* s = x; VAL [s={-1:0}, x={-1:0}, y={-1:0}] [L566] EXPR x->next [L566] COND FALSE !(x->next != ((void *)0)) [L568] x->next = y [L569] return s; VAL [\result={-1:0}] [L578] RET, EXPR append(x, x) [L578] node_t* y = append(x, x); [L579] CALL length(y) VAL [\old(xs)={-1:0}] Loop: [L557] COND FALSE !(xs == ((void *)0)) [L559] EXPR xs->next [L559] CALL length(xs->next) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-09 15:26:28,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-09 15:26:28,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)