./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/openbsd_cstpcpy-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/openbsd_cstpcpy-alloca-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 bebfef36417cc629a011ca1d30e6696f3048116bc9623a75bf9b2a872de91ab8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:25:11,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:25:11,355 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-08 14:25:11,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:25:11,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:25:11,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:25:11,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:25:11,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:25:11,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:25:11,385 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:25:11,385 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:25:11,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:25:11,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:25:11,386 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:25:11,386 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:25:11,386 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:25:11,386 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:25:11,386 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:25:11,386 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:25:11,387 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:25:11,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:25:11,387 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:25:11,387 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:25:11,387 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:25:11,387 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:25:11,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:25:11,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:25:11,387 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:25:11,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:25:11,387 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:25:11,388 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:25:11,388 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:25:11,388 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:25:11,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:25:11,388 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:25:11,388 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:25:11,389 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:25:11,389 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/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 -> bebfef36417cc629a011ca1d30e6696f3048116bc9623a75bf9b2a872de91ab8 [2025-02-08 14:25:11,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:25:11,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:25:11,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:25:11,628 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:25:11,629 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:25:11,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/openbsd_cstpcpy-alloca-2.i [2025-02-08 14:25:12,879 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94fc45522/146d254f6ea74c4ebcd142d77bf21804/FLAG30d80ad91 [2025-02-08 14:25:13,191 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:25:13,192 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstpcpy-alloca-2.i [2025-02-08 14:25:13,204 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94fc45522/146d254f6ea74c4ebcd142d77bf21804/FLAG30d80ad91 [2025-02-08 14:25:13,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94fc45522/146d254f6ea74c4ebcd142d77bf21804 [2025-02-08 14:25:13,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:25:13,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:25:13,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:25:13,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:25:13,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:25:13,455 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:25:13" (1/1) ... [2025-02-08 14:25:13,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab664ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:13, skipping insertion in model container [2025-02-08 14:25:13,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:25:13" (1/1) ... [2025-02-08 14:25:13,474 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:25:13,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:25:13,703 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:25:13,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:25:13,759 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:25:13,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:13 WrapperNode [2025-02-08 14:25:13,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:25:13,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:25:13,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:25:13,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:25:13,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:13" (1/1) ... [2025-02-08 14:25:13,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:13" (1/1) ... [2025-02-08 14:25:13,787 INFO L138 Inliner]: procedures = 111, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 51 [2025-02-08 14:25:13,788 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:25:13,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:25:13,789 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:25:13,789 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:25:13,794 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:13" (1/1) ... [2025-02-08 14:25:13,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:13" (1/1) ... [2025-02-08 14:25:13,796 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:13" (1/1) ... [2025-02-08 14:25:13,805 INFO L175 MemorySlicer]: Split 3 memory accesses to 2 slices as follows [1, 2]. 67 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2025-02-08 14:25:13,805 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:13" (1/1) ... [2025-02-08 14:25:13,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:13" (1/1) ... [2025-02-08 14:25:13,813 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:13" (1/1) ... [2025-02-08 14:25:13,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:13" (1/1) ... [2025-02-08 14:25:13,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:13" (1/1) ... [2025-02-08 14:25:13,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:13" (1/1) ... [2025-02-08 14:25:13,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:25:13,819 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:25:13,822 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:25:13,822 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:25:13,823 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:13" (1/1) ... [2025-02-08 14:25:13,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:25:13,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:25:13,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:25:13,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-08 14:25:13,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:25:13,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:25:13,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:25:13,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:25:13,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 14:25:13,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 14:25:13,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:25:13,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:25:13,950 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:25:13,953 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:25:14,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L562: call ULTIMATE.dealloc(main_#t~malloc7#1.base, main_#t~malloc7#1.offset);havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call ULTIMATE.dealloc(main_#t~malloc8#1.base, main_#t~malloc8#1.offset);havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; [2025-02-08 14:25:14,066 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-08 14:25:14,067 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:25:14,072 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:25:14,072 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:25:14,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:25:14 BoogieIcfgContainer [2025-02-08 14:25:14,072 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:25:14,073 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:25:14,073 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:25:14,077 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:25:14,077 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:25:14,077 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:25:13" (1/3) ... [2025-02-08 14:25:14,078 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32bee41e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:25:14, skipping insertion in model container [2025-02-08 14:25:14,078 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:25:14,078 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:13" (2/3) ... [2025-02-08 14:25:14,078 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32bee41e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:25:14, skipping insertion in model container [2025-02-08 14:25:14,078 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:25:14,078 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:25:14" (3/3) ... [2025-02-08 14:25:14,079 INFO L363 chiAutomizerObserver]: Analyzing ICFG openbsd_cstpcpy-alloca-2.i [2025-02-08 14:25:14,109 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:25:14,109 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:25:14,109 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:25:14,109 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:25:14,109 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:25:14,109 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:25:14,110 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:25:14,110 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:25:14,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:25:14,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:25:14,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:25:14,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:25:14,125 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-08 14:25:14,125 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:25:14,125 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:25:14,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:25:14,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:25:14,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:25:14,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:25:14,126 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-08 14:25:14,126 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:25:14,130 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc main_#t~nondet5#1;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(main_~length1~0#1 < 1);" "assume main_~length2~0#1 < 1;main_~length2~0#1 := 1;" "assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int#1(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstpcpy } true;cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset, cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc cstpcpy_#res#1.base, cstpcpy_#res#1.offset;havoc cstpcpy_#t~mem2#1, cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset, cstpcpy_#t~pre4#1.base, cstpcpy_#t~pre4#1.offset, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, cstpcpy_~from#1.base, cstpcpy_~from#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset;" [2025-02-08 14:25:14,130 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstpcpy_#t~mem2#1 := read~int#1(cstpcpy_~from#1.base, cstpcpy_~from#1.offset, 1);call write~int#0(cstpcpy_#t~mem2#1, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, 1);" "assume 0 != cstpcpy_#t~mem2#1;havoc cstpcpy_#t~mem2#1;cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;havoc cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset;cstpcpy_#t~pre4#1.base, cstpcpy_#t~pre4#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;havoc cstpcpy_#t~pre4#1.base, cstpcpy_#t~pre4#1.offset;" [2025-02-08 14:25:14,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:25:14,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1507327, now seen corresponding path program 1 times [2025-02-08 14:25:14,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:25:14,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891172630] [2025-02-08 14:25:14,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:25:14,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:25:14,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:25:14,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:25:14,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:14,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:14,213 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:25:14,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:25:14,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:25:14,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:14,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:14,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:25:14,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:25:14,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1216, now seen corresponding path program 1 times [2025-02-08 14:25:14,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:25:14,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795281142] [2025-02-08 14:25:14,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:25:14,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:25:14,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:25:14,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:25:14,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:14,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:14,264 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:25:14,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:25:14,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:25:14,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:14,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:14,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:25:14,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:25:14,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1448541502, now seen corresponding path program 1 times [2025-02-08 14:25:14,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:25:14,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239770442] [2025-02-08 14:25:14,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:25:14,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:25:14,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:25:14,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:25:14,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:14,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:25:14,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:25:14,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:25:14,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239770442] [2025-02-08 14:25:14,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239770442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:25:14,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:25:14,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:25:14,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705001367] [2025-02-08 14:25:14,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:25:14,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:25:14,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:25:14,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:25:14,685 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:25:14,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:25:14,721 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2025-02-08 14:25:14,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 18 transitions. [2025-02-08 14:25:14,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:25:14,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 6 states and 7 transitions. [2025-02-08 14:25:14,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-02-08 14:25:14,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-02-08 14:25:14,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2025-02-08 14:25:14,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:25:14,727 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions. [2025-02-08 14:25:14,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2025-02-08 14:25:14,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2025-02-08 14:25:14,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:25:14,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2025-02-08 14:25:14,742 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions. [2025-02-08 14:25:14,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:25:14,745 INFO L432 stractBuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2025-02-08 14:25:14,745 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:25:14,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2025-02-08 14:25:14,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:25:14,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:25:14,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:25:14,746 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-08 14:25:14,746 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:25:14,746 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc main_#t~nondet5#1;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int#1(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstpcpy } true;cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset, cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc cstpcpy_#res#1.base, cstpcpy_#res#1.offset;havoc cstpcpy_#t~mem2#1, cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset, cstpcpy_#t~pre4#1.base, cstpcpy_#t~pre4#1.offset, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, cstpcpy_~from#1.base, cstpcpy_~from#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset;" [2025-02-08 14:25:14,746 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstpcpy_#t~mem2#1 := read~int#1(cstpcpy_~from#1.base, cstpcpy_~from#1.offset, 1);call write~int#0(cstpcpy_#t~mem2#1, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, 1);" "assume 0 != cstpcpy_#t~mem2#1;havoc cstpcpy_#t~mem2#1;cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;havoc cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset;cstpcpy_#t~pre4#1.base, cstpcpy_#t~pre4#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;havoc cstpcpy_#t~pre4#1.base, cstpcpy_#t~pre4#1.offset;" [2025-02-08 14:25:14,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:25:14,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1507358, now seen corresponding path program 1 times [2025-02-08 14:25:14,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:25:14,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009711404] [2025-02-08 14:25:14,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:25:14,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:25:14,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:25:14,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:25:14,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:14,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:14,761 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:25:14,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:25:14,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:25:14,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:14,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:14,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:25:14,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:25:14,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1216, now seen corresponding path program 2 times [2025-02-08 14:25:14,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:25:14,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601270371] [2025-02-08 14:25:14,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:25:14,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:25:14,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:25:14,775 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:25:14,775 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:25:14,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:14,775 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:25:14,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:25:14,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:25:14,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:14,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:14,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:25:14,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:25:14,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1448571293, now seen corresponding path program 1 times [2025-02-08 14:25:14,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:25:14,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413853920] [2025-02-08 14:25:14,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:25:14,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:25:14,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:25:14,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:25:14,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:14,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:14,826 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:25:14,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:25:14,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:25:14,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:14,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:14,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:25:15,343 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:25:15,345 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:25:15,345 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:25:15,345 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:25:15,345 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:25:15,345 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:25:15,345 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:25:15,345 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:25:15,345 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstpcpy-alloca-2.i_Iteration2_Lasso [2025-02-08 14:25:15,346 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:25:15,346 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:25:15,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:15,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:15,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:15,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:15,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:15,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:15,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:15,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:15,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:15,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:15,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:15,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:15,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:15,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:15,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:15,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:15,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:15,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:15,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:15,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:15,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:15,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:15,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:15,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:15,921 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:25:15,923 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:25:15,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:25:15,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:25:15,926 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:25:15,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-08 14:25:15,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:25:15,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:25:15,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:25:15,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:25:15,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:25:15,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:25:15,944 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:25:15,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:25:15,951 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:25:15,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-08 14:25:15,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:25:15,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:25:15,964 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:25:15,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-08 14:25:15,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:25:15,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:25:15,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:25:15,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:25:15,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:25:15,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:25:15,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:25:15,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:25:15,984 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:25:15,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-08 14:25:15,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:25:15,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:25:15,993 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:25:15,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-08 14:25:15,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:25:16,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:25:16,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:25:16,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:25:16,006 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-08 14:25:16,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:25:16,007 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-08 14:25:16,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:25:16,012 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:25:16,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-08 14:25:16,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:25:16,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:25:16,021 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:25:16,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-08 14:25:16,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:25:16,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:25:16,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:25:16,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:25:16,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:25:16,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:25:16,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:25:16,048 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:25:16,084 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-02-08 14:25:16,086 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-02-08 14:25:16,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:25:16,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:25:16,089 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:25:16,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-08 14:25:16,092 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:25:16,103 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:25:16,103 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:25:16,104 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstpcpy_~from#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc8#1.base)_1) = -1*ULTIMATE.start_cstpcpy_~from#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8#1.base)_1 Supporting invariants [] [2025-02-08 14:25:16,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-08 14:25:16,145 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2025-02-08 14:25:16,155 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-08 14:25:16,160 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-08 14:25:16,161 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~from!offset [2025-02-08 14:25:16,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:25:16,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:25:16,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:25:16,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:16,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:25:16,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:25:16,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:25:16,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:25:16,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:25:16,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:16,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:25:16,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:25:16,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:25:16,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:25:16,288 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-08 14:25:16,289 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:25:16,366 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 8 states and 10 transitions. Complement of second has 4 states. [2025-02-08 14:25:16,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-08 14:25:16,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:25:16,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-02-08 14:25:16,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-08 14:25:16,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:25:16,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-08 14:25:16,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:25:16,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2025-02-08 14:25:16,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:25:16,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 10 transitions. [2025-02-08 14:25:16,379 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:25:16,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 0 states and 0 transitions. [2025-02-08 14:25:16,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-08 14:25:16,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-08 14:25:16,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-08 14:25:16,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:25:16,379 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:25:16,379 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:25:16,379 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:25:16,379 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:25:16,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-08 14:25:16,379 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:25:16,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-08 14:25:16,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:25:16 BoogieIcfgContainer [2025-02-08 14:25:16,390 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:25:16,390 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:25:16,393 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:25:16,394 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:25:16,394 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:25:14" (3/4) ... [2025-02-08 14:25:16,396 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 14:25:16,396 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:25:16,397 INFO L158 Benchmark]: Toolchain (without parser) took 2947.07ms. Allocated memory is still 201.3MB. Free memory was 158.1MB in the beginning and 138.7MB in the end (delta: 19.4MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2025-02-08 14:25:16,401 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 209.7MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:25:16,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.37ms. Allocated memory is still 201.3MB. Free memory was 158.1MB in the beginning and 141.9MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 14:25:16,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.54ms. Allocated memory is still 201.3MB. Free memory was 141.9MB in the beginning and 140.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:25:16,401 INFO L158 Benchmark]: Boogie Preprocessor took 29.36ms. Allocated memory is still 201.3MB. Free memory was 140.3MB in the beginning and 139.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:25:16,401 INFO L158 Benchmark]: IcfgBuilder took 253.60ms. Allocated memory is still 201.3MB. Free memory was 139.1MB in the beginning and 126.6MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 14:25:16,402 INFO L158 Benchmark]: BuchiAutomizer took 2316.78ms. Allocated memory is still 201.3MB. Free memory was 126.6MB in the beginning and 138.7MB in the end (delta: -12.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:25:16,402 INFO L158 Benchmark]: Witness Printer took 6.61ms. Allocated memory is still 201.3MB. Free memory was 138.7MB in the beginning and 138.7MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:25:16,403 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.15ms. Allocated memory is still 209.7MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.37ms. Allocated memory is still 201.3MB. Free memory was 158.1MB in the beginning and 141.9MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.54ms. Allocated memory is still 201.3MB. Free memory was 141.9MB in the beginning and 140.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.36ms. Allocated memory is still 201.3MB. Free memory was 140.3MB in the beginning and 139.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 253.60ms. Allocated memory is still 201.3MB. Free memory was 139.1MB in the beginning and 126.6MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 2316.78ms. Allocated memory is still 201.3MB. Free memory was 126.6MB in the beginning and 138.7MB in the end (delta: -12.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.61ms. Allocated memory is still 201.3MB. Free memory was 138.7MB in the beginning and 138.7MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~from!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 19 mSDtfsCounter, 31 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital181 mio100 ax109 hnf100 lsp90 ukn78 mio100 lsp28 div100 bol100 ite100 ukn100 eq154 hnf91 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 84ms VariablesStem: 4 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-08 14:25:16,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-08 14:25:16,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE