./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrncat_malloc.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/cstrncat_malloc.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 5a61fb3bdd8c8080e4dbcf48deea241cadeed4c02fef8952e5b51d0e829dea4f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:56:20,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:56:20,626 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-09 06:56:20,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:56:20,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:56:20,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 06:56:20,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:56:20,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:56:20,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:56:20,655 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:56:20,655 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:56:20,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:56:20,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:56:20,656 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:56:20,656 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 06:56:20,656 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 06:56:20,656 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 06:56:20,656 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 06:56:20,656 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 06:56:20,657 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 06:56:20,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:56:20,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 06:56:20,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:56:20,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:56:20,657 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 06:56:20,657 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 06:56:20,657 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 06:56:20,657 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:56:20,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:56:20,657 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 06:56:20,658 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:56:20,658 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:56:20,658 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:56:20,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:56:20,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:56:20,658 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:56:20,659 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 06:56:20,659 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a61fb3bdd8c8080e4dbcf48deea241cadeed4c02fef8952e5b51d0e829dea4f [2025-03-09 06:56:20,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:56:20,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:56:20,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:56:20,887 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:56:20,887 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:56:20,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrncat_malloc.i [2025-03-09 06:56:22,019 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02bb134b7/e831b665d7bc4546af7024b2fe67bd77/FLAGc94b24148 [2025-03-09 06:56:22,266 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:56:22,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrncat_malloc.i [2025-03-09 06:56:22,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02bb134b7/e831b665d7bc4546af7024b2fe67bd77/FLAGc94b24148 [2025-03-09 06:56:22,590 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02bb134b7/e831b665d7bc4546af7024b2fe67bd77 [2025-03-09 06:56:22,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:56:22,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:56:22,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:56:22,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:56:22,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:56:22,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:56:22" (1/1) ... [2025-03-09 06:56:22,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eff0d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:22, skipping insertion in model container [2025-03-09 06:56:22,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:56:22" (1/1) ... [2025-03-09 06:56:22,624 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:56:22,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:56:22,844 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:56:22,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:56:22,911 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:56:22,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:22 WrapperNode [2025-03-09 06:56:22,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:56:22,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:56:22,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:56:22,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:56:22,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:22" (1/1) ... [2025-03-09 06:56:22,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:22" (1/1) ... [2025-03-09 06:56:22,945 INFO L138 Inliner]: procedures = 152, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77 [2025-03-09 06:56:22,945 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:56:22,946 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:56:22,946 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:56:22,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:56:22,952 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:22" (1/1) ... [2025-03-09 06:56:22,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:22" (1/1) ... [2025-03-09 06:56:22,954 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:22" (1/1) ... [2025-03-09 06:56:22,968 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [5, 2]. 71 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [3, 1]. [2025-03-09 06:56:22,969 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:22" (1/1) ... [2025-03-09 06:56:22,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:22" (1/1) ... [2025-03-09 06:56:22,972 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:22" (1/1) ... [2025-03-09 06:56:22,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:22" (1/1) ... [2025-03-09 06:56:22,973 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:22" (1/1) ... [2025-03-09 06:56:22,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:22" (1/1) ... [2025-03-09 06:56:22,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:56:22,974 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:56:22,974 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:56:22,974 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:56:22,975 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:22" (1/1) ... [2025-03-09 06:56:22,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:22,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:23,001 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:23,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-09 06:56:23,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:56:23,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:56:23,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:56:23,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:56:23,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 06:56:23,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:56:23,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:56:23,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:56:23,067 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:56:23,068 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:56:23,184 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-09 06:56:23,184 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:56:23,193 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:56:23,193 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:56:23,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:56:23 BoogieIcfgContainer [2025-03-09 06:56:23,194 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:56:23,194 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 06:56:23,194 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 06:56:23,197 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 06:56:23,198 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:56:23,198 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 06:56:22" (1/3) ... [2025-03-09 06:56:23,199 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@525d506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:56:23, skipping insertion in model container [2025-03-09 06:56:23,199 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:56:23,199 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:22" (2/3) ... [2025-03-09 06:56:23,199 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@525d506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:56:23, skipping insertion in model container [2025-03-09 06:56:23,199 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:56:23,199 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:56:23" (3/3) ... [2025-03-09 06:56:23,200 INFO L363 chiAutomizerObserver]: Analyzing ICFG cstrncat_malloc.i [2025-03-09 06:56:23,233 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 06:56:23,233 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 06:56:23,233 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 06:56:23,233 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 06:56:23,234 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 06:56:23,234 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 06:56:23,234 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 06:56:23,234 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 06:56:23,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:23,252 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-09 06:56:23,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:23,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:23,255 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:56:23,255 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:56:23,256 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 06:56:23,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:23,257 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-09 06:56:23,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:23,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:23,258 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:56:23,258 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:56:23,262 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~nondet213#1, main_#t~nondet214#1, main_#t~nondet215#1, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~malloc217#1.base, main_#t~malloc217#1.offset, main_#t~ret218#1.base, main_#t~ret218#1.offset, main_~length1~0#1, main_~length2~0#1, main_~n~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1;havoc main_#t~nondet215#1;main_~n~0#1 := main_#t~nondet215#1;havoc main_#t~nondet215#1;" "assume main_~length1~0#1 < 1;main_~length1~0#1 := 1;" "assume !(main_~length2~0#1 < 1);" "assume !(main_~n~0#1 < 1);" "assume !(main_~length1~0#1 < main_~n~0#1 || main_~length1~0#1 - main_~n~0#1 < main_~length2~0#1);call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call main_#t~malloc217#1.base, main_#t~malloc217#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc217#1.base, main_#t~malloc217#1.offset;havoc main_#t~malloc217#1.base, main_#t~malloc217#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - main_~n~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrncat } true;cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset, cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset, cstrncat_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~0#1;havoc cstrncat_#res#1.base, cstrncat_#res#1.offset;havoc cstrncat_#t~mem205#1, cstrncat_#t~post206#1.base, cstrncat_#t~post206#1.offset, cstrncat_#t~post207#1.base, cstrncat_#t~post207#1.offset, cstrncat_#t~mem208#1, cstrncat_#t~short209#1, cstrncat_#t~post210#1, cstrncat_#t~post211#1.base, cstrncat_#t~post211#1.offset, cstrncat_#t~mem212#1, cstrncat_~s1#1.base, cstrncat_~s1#1.offset, cstrncat_~s2#1.base, cstrncat_~s2#1.offset, cstrncat_~n#1, cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s1#1.base, cstrncat_~s1#1.offset := cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset;cstrncat_~s2#1.base, cstrncat_~s2#1.offset := cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset;cstrncat_~n#1 := cstrncat_#in~n#1;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_~s1#1.base, cstrncat_~s1#1.offset;" [2025-03-09 06:56:23,263 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrncat_#t~mem205#1 := read~int#0(cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset, 1);" "assume 0 != cstrncat_#t~mem205#1;havoc cstrncat_#t~mem205#1;cstrncat_#t~post206#1.base, cstrncat_#t~post206#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post206#1.base, 1 + cstrncat_#t~post206#1.offset;" [2025-03-09 06:56:23,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:23,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1892324253, now seen corresponding path program 1 times [2025-03-09 06:56:23,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:23,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972433835] [2025-03-09 06:56:23,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:56:23,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:23,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:56:23,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:56:23,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:23,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:23,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:23,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:56:23,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972433835] [2025-03-09 06:56:23,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972433835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:56:23,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:56:23,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:56:23,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939711827] [2025-03-09 06:56:23,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:56:23,506 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:56:23,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:23,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1600, now seen corresponding path program 1 times [2025-03-09 06:56:23,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:23,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890688004] [2025-03-09 06:56:23,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:56:23,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:23,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:23,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:23,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:23,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:23,518 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:23,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:23,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:23,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:23,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:23,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:23,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:56:23,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:56:23,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:56:23,638 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 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-03-09 06:56:23,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:56:23,699 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. [2025-03-09 06:56:23,699 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. [2025-03-09 06:56:23,700 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-09 06:56:23,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 11 states and 15 transitions. [2025-03-09 06:56:23,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-09 06:56:23,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 06:56:23,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2025-03-09 06:56:23,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:56:23,708 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-03-09 06:56:23,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2025-03-09 06:56:23,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-09 06:56:23,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:23,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2025-03-09 06:56:23,722 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-03-09 06:56:23,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:56:23,725 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-03-09 06:56:23,725 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 06:56:23,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2025-03-09 06:56:23,726 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-09 06:56:23,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:23,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:23,726 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:56:23,726 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:56:23,726 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~nondet213#1, main_#t~nondet214#1, main_#t~nondet215#1, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~malloc217#1.base, main_#t~malloc217#1.offset, main_#t~ret218#1.base, main_#t~ret218#1.offset, main_~length1~0#1, main_~length2~0#1, main_~n~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1;havoc main_#t~nondet215#1;main_~n~0#1 := main_#t~nondet215#1;havoc main_#t~nondet215#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "assume !(main_~n~0#1 < 1);" "assume !(main_~length1~0#1 < main_~n~0#1 || main_~length1~0#1 - main_~n~0#1 < main_~length2~0#1);call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call main_#t~malloc217#1.base, main_#t~malloc217#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc217#1.base, main_#t~malloc217#1.offset;havoc main_#t~malloc217#1.base, main_#t~malloc217#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - main_~n~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrncat } true;cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset, cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset, cstrncat_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~0#1;havoc cstrncat_#res#1.base, cstrncat_#res#1.offset;havoc cstrncat_#t~mem205#1, cstrncat_#t~post206#1.base, cstrncat_#t~post206#1.offset, cstrncat_#t~post207#1.base, cstrncat_#t~post207#1.offset, cstrncat_#t~mem208#1, cstrncat_#t~short209#1, cstrncat_#t~post210#1, cstrncat_#t~post211#1.base, cstrncat_#t~post211#1.offset, cstrncat_#t~mem212#1, cstrncat_~s1#1.base, cstrncat_~s1#1.offset, cstrncat_~s2#1.base, cstrncat_~s2#1.offset, cstrncat_~n#1, cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s1#1.base, cstrncat_~s1#1.offset := cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset;cstrncat_~s2#1.base, cstrncat_~s2#1.offset := cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset;cstrncat_~n#1 := cstrncat_#in~n#1;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_~s1#1.base, cstrncat_~s1#1.offset;" [2025-03-09 06:56:23,726 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrncat_#t~mem205#1 := read~int#0(cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset, 1);" "assume 0 != cstrncat_#t~mem205#1;havoc cstrncat_#t~mem205#1;cstrncat_#t~post206#1.base, cstrncat_#t~post206#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post206#1.base, 1 + cstrncat_#t~post206#1.offset;" [2025-03-09 06:56:23,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:23,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1892354044, now seen corresponding path program 1 times [2025-03-09 06:56:23,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:23,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239839756] [2025-03-09 06:56:23,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:56:23,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:23,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:56:23,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:56:23,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:23,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:23,752 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:23,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:56:23,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:56:23,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:23,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:23,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:23,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:23,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1600, now seen corresponding path program 2 times [2025-03-09 06:56:23,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:23,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762852847] [2025-03-09 06:56:23,777 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:56:23,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:23,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:23,786 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:23,788 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:56:23,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:23,788 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:23,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:23,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:23,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:23,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:23,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:23,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:23,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1781070715, now seen corresponding path program 1 times [2025-03-09 06:56:23,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:23,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299152063] [2025-03-09 06:56:23,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:56:23,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:23,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:56:23,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:56:23,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:23,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:23,837 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:23,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:56:23,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:56:23,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:23,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:23,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:24,523 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:56:24,524 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:56:24,524 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:56:24,524 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:56:24,525 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:56:24,525 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:24,525 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:56:24,525 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:56:24,525 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrncat_malloc.i_Iteration2_Lasso [2025-03-09 06:56:24,525 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:56:24,525 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:56:24,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:24,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:25,133 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:56:25,136 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:56:25,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:25,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:25,139 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:25,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-09 06:56:25,142 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:25,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:25,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:25,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:25,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:25,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:25,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:25,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:25,161 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:25,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-09 06:56:25,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:25,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:25,169 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:25,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-09 06:56:25,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:25,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:25,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:25,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:25,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:25,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:25,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:25,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:25,185 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:25,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-09 06:56:25,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:25,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:25,193 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:25,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-09 06:56:25,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:25,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:25,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:25,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:25,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:25,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:25,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:25,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:25,207 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:25,212 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 [2025-03-09 06:56:25,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:25,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:25,214 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:25,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-09 06:56:25,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:25,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:25,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:25,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:25,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:25,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:25,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:25,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:25,231 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:25,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-09 06:56:25,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:25,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:25,241 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:25,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-09 06:56:25,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:25,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:25,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:25,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:25,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:25,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:25,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:25,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:25,264 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:25,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-09 06:56:25,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:25,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:25,272 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:25,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-09 06:56:25,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:25,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:25,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:25,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:25,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:25,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:25,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:25,292 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:25,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-09 06:56:25,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:25,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:25,300 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:25,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-09 06:56:25,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:25,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:25,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:25,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:25,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:25,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:25,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:25,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:25,323 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:25,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-09 06:56:25,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:25,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:25,336 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:25,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-09 06:56:25,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:25,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:25,363 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2025-03-09 06:56:25,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:25,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:25,375 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-03-09 06:56:25,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:25,386 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:25,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-09 06:56:25,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:25,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:25,396 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:25,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-09 06:56:25,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:25,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:25,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:25,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:25,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:25,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:25,416 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:25,424 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:56:25,458 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-09 06:56:25,459 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-03-09 06:56:25,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:25,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:25,464 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:25,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-09 06:56:25,467 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:56:25,478 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:56:25,479 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:56:25,479 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncat_~s~0#1.offset, v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1) = -1*ULTIMATE.start_cstrncat_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1 Supporting invariants [] [2025-03-09 06:56:25,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-09 06:56:25,501 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2025-03-09 06:56:25,507 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-09 06:56:25,508 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-09 06:56:25,508 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-09 06:56:25,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:25,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:56:25,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:56:25,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:25,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:25,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:56:25,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:25,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:25,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:25,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:25,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:25,575 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:56:25,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:25,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:25,592 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-03-09 06:56:25,593 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:25,640 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 34 transitions. Complement of second has 6 states. [2025-03-09 06:56:25,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-09 06:56:25,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:25,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2025-03-09 06:56:25,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 6 letters. Loop has 2 letters. [2025-03-09 06:56:25,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:25,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 8 letters. Loop has 2 letters. [2025-03-09 06:56:25,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:25,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 6 letters. Loop has 4 letters. [2025-03-09 06:56:25,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:25,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 34 transitions. [2025-03-09 06:56:25,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:56:25,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 26 transitions. [2025-03-09 06:56:25,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 06:56:25,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 06:56:25,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2025-03-09 06:56:25,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:56:25,647 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2025-03-09 06:56:25,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2025-03-09 06:56:25,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2025-03-09 06:56:25,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:25,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2025-03-09 06:56:25,648 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2025-03-09 06:56:25,648 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2025-03-09 06:56:25,649 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 06:56:25,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2025-03-09 06:56:25,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:56:25,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:25,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:25,649 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:56:25,649 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:56:25,650 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~nondet213#1, main_#t~nondet214#1, main_#t~nondet215#1, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~malloc217#1.base, main_#t~malloc217#1.offset, main_#t~ret218#1.base, main_#t~ret218#1.offset, main_~length1~0#1, main_~length2~0#1, main_~n~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1;havoc main_#t~nondet215#1;main_~n~0#1 := main_#t~nondet215#1;havoc main_#t~nondet215#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "assume !(main_~n~0#1 < 1);" "assume !(main_~length1~0#1 < main_~n~0#1 || main_~length1~0#1 - main_~n~0#1 < main_~length2~0#1);call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call main_#t~malloc217#1.base, main_#t~malloc217#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc217#1.base, main_#t~malloc217#1.offset;havoc main_#t~malloc217#1.base, main_#t~malloc217#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - main_~n~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrncat } true;cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset, cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset, cstrncat_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~0#1;havoc cstrncat_#res#1.base, cstrncat_#res#1.offset;havoc cstrncat_#t~mem205#1, cstrncat_#t~post206#1.base, cstrncat_#t~post206#1.offset, cstrncat_#t~post207#1.base, cstrncat_#t~post207#1.offset, cstrncat_#t~mem208#1, cstrncat_#t~short209#1, cstrncat_#t~post210#1, cstrncat_#t~post211#1.base, cstrncat_#t~post211#1.offset, cstrncat_#t~mem212#1, cstrncat_~s1#1.base, cstrncat_~s1#1.offset, cstrncat_~s2#1.base, cstrncat_~s2#1.offset, cstrncat_~n#1, cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s1#1.base, cstrncat_~s1#1.offset := cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset;cstrncat_~s2#1.base, cstrncat_~s2#1.offset := cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset;cstrncat_~n#1 := cstrncat_#in~n#1;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_~s1#1.base, cstrncat_~s1#1.offset;" "assume true;call cstrncat_#t~mem205#1 := read~int#0(cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset, 1);" "assume !(0 != cstrncat_#t~mem205#1);havoc cstrncat_#t~mem205#1;" "assume true;cstrncat_#t~short209#1 := 0 != cstrncat_~n#1;" "assume !cstrncat_#t~short209#1;" "assume cstrncat_#t~short209#1;havoc cstrncat_#t~post207#1.base, cstrncat_#t~post207#1.offset;havoc cstrncat_#t~mem208#1;havoc cstrncat_#t~short209#1;cstrncat_#t~post210#1 := cstrncat_~n#1;cstrncat_~n#1 := cstrncat_#t~post210#1 - 1;havoc cstrncat_#t~post210#1;cstrncat_#t~post211#1.base, cstrncat_#t~post211#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post211#1.base, 1 + cstrncat_#t~post211#1.offset;havoc cstrncat_#t~post211#1.base, cstrncat_#t~post211#1.offset;" "assume true;cstrncat_#t~short209#1 := 0 != cstrncat_~n#1;" [2025-03-09 06:56:25,650 INFO L754 eck$LassoCheckResult]: Loop: "assume !cstrncat_#t~short209#1;" "assume cstrncat_#t~short209#1;havoc cstrncat_#t~post207#1.base, cstrncat_#t~post207#1.offset;havoc cstrncat_#t~mem208#1;havoc cstrncat_#t~short209#1;cstrncat_#t~post210#1 := cstrncat_~n#1;cstrncat_~n#1 := cstrncat_#t~post210#1 - 1;havoc cstrncat_#t~post210#1;cstrncat_#t~post211#1.base, cstrncat_#t~post211#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post211#1.base, 1 + cstrncat_#t~post211#1.offset;havoc cstrncat_#t~post211#1.base, cstrncat_#t~post211#1.offset;" "assume true;cstrncat_#t~short209#1 := 0 != cstrncat_~n#1;" [2025-03-09 06:56:25,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:25,650 INFO L85 PathProgramCache]: Analyzing trace with hash -302957092, now seen corresponding path program 1 times [2025-03-09 06:56:25,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:25,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092436525] [2025-03-09 06:56:25,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:56:25,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:25,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:56:25,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:56:25,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:25,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:25,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:25,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:56:25,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092436525] [2025-03-09 06:56:25,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092436525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:56:25,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:56:25,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:56:25,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960176165] [2025-03-09 06:56:25,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:56:25,699 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:56:25,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:25,699 INFO L85 PathProgramCache]: Analyzing trace with hash 42639, now seen corresponding path program 1 times [2025-03-09 06:56:25,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:25,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351167006] [2025-03-09 06:56:25,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:56:25,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:25,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:56:25,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:56:25,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:25,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:25,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:25,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:56:25,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351167006] [2025-03-09 06:56:25,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351167006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:56:25,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:56:25,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:56:25,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62767902] [2025-03-09 06:56:25,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:56:25,709 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:56:25,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:56:25,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:56:25,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:56:25,709 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:25,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:56:25,717 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2025-03-09 06:56:25,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2025-03-09 06:56:25,718 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 06:56:25,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2025-03-09 06:56:25,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-09 06:56:25,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-09 06:56:25,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-09 06:56:25,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:56:25,718 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:56:25,718 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:56:25,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:56:25,719 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:56:25,719 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 06:56:25,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-09 06:56:25,719 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 06:56:25,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-09 06:56:25,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 06:56:25 BoogieIcfgContainer [2025-03-09 06:56:25,726 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 06:56:25,727 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 06:56:25,727 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 06:56:25,727 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 06:56:25,727 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:56:23" (3/4) ... [2025-03-09 06:56:25,729 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 06:56:25,730 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 06:56:25,731 INFO L158 Benchmark]: Toolchain (without parser) took 3136.80ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 77.2MB in the end (delta: 33.6MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. [2025-03-09 06:56:25,731 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:56:25,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.37ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 92.2MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 06:56:25,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.30ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:56:25,731 INFO L158 Benchmark]: Boogie Preprocessor took 27.85ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 89.2MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:56:25,732 INFO L158 Benchmark]: IcfgBuilder took 219.20ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 75.5MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:56:25,732 INFO L158 Benchmark]: BuchiAutomizer took 2532.01ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 78.3MB in the end (delta: -3.3MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. [2025-03-09 06:56:25,732 INFO L158 Benchmark]: Witness Printer took 3.33ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 77.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:56:25,733 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.37ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 92.2MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.30ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.85ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 89.2MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 219.20ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 75.5MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 2532.01ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 78.3MB in the end (delta: -3.3MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. * Witness Printer took 3.33ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 77.2MB in the end (delta: 1.0MB). 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: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 2.1s. 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 1. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 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, 19 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 121 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 66 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 55 mSDtfsCounter, 41 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI1 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital199 mio100 ax100 hnf100 lsp96 ukn65 mio100 lsp49 div100 bol100 ite100 ukn100 eq134 hnf94 smp100 dnf207 smp82 tf100 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 54ms VariablesStem: 6 VariablesLoop: 3 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-09 06:56:25,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-09 06:56:25,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE