./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f1ad2d5826e88851ec05294e79547a11a54665f4a2cf6f0e66f9eabed656148f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:40:51,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:40:51,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-04 15:40:51,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:40:51,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:40:51,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:40:51,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:40:51,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:40:51,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:40:51,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:40:51,767 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:40:51,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:40:51,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:40:51,768 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:40:51,768 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:40:51,768 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:40:51,768 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:40:51,768 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:40:51,768 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:40:51,768 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:40:51,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:40:51,769 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:40:51,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:40:51,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:40:51,769 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:40:51,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:40:51,769 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:40:51,769 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:40:51,769 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:40:51,769 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:40:51,769 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:40:51,770 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:40:51,770 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:40:51,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:40:51,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:40:51,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:40:51,771 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:40:51,771 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 -> f1ad2d5826e88851ec05294e79547a11a54665f4a2cf6f0e66f9eabed656148f [2025-03-04 15:40:51,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:40:51,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:40:51,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:40:52,000 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:40:52,000 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:40:52,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca-2.i [2025-03-04 15:40:53,148 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feedd1398/d55f8f4388784439a811e87a5ef5a03e/FLAG3d4135284 [2025-03-04 15:40:53,424 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:40:53,424 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca-2.i [2025-03-04 15:40:53,434 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feedd1398/d55f8f4388784439a811e87a5ef5a03e/FLAG3d4135284 [2025-03-04 15:40:53,445 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feedd1398/d55f8f4388784439a811e87a5ef5a03e [2025-03-04 15:40:53,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:40:53,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:40:53,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:40:53,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:40:53,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:40:53,455 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:40:53" (1/1) ... [2025-03-04 15:40:53,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30e91fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:53, skipping insertion in model container [2025-03-04 15:40:53,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:40:53" (1/1) ... [2025-03-04 15:40:53,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:40:53,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:40:53,639 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:40:53,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:40:53,695 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:40:53,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:53 WrapperNode [2025-03-04 15:40:53,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:40:53,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:40:53,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:40:53,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:40:53,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:53" (1/1) ... [2025-03-04 15:40:53,707 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:53" (1/1) ... [2025-03-04 15:40:53,722 INFO L138 Inliner]: procedures = 111, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2025-03-04 15:40:53,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:40:53,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:40:53,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:40:53,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:40:53,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:53" (1/1) ... [2025-03-04 15:40:53,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:53" (1/1) ... [2025-03-04 15:40:53,731 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:53" (1/1) ... [2025-03-04 15:40:53,738 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [3, 3]. 50 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-04 15:40:53,739 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:53" (1/1) ... [2025-03-04 15:40:53,739 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:53" (1/1) ... [2025-03-04 15:40:53,742 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:53" (1/1) ... [2025-03-04 15:40:53,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:53" (1/1) ... [2025-03-04 15:40:53,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:53" (1/1) ... [2025-03-04 15:40:53,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:53" (1/1) ... [2025-03-04 15:40:53,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:40:53,745 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:40:53,745 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:40:53,746 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:40:53,746 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:53" (1/1) ... [2025-03-04 15:40:53,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:53,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:53,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:53,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-04 15:40:53,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:40:53,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:40:53,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:40:53,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:40:53,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:40:53,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:40:53,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:40:53,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:40:53,864 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:40:53,865 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:40:53,983 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L576: call ULTIMATE.dealloc(main_#t~malloc10#1.base, main_#t~malloc10#1.offset);havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call ULTIMATE.dealloc(main_#t~malloc11#1.base, main_#t~malloc11#1.offset);havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset; [2025-03-04 15:40:53,999 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-03-04 15:40:53,999 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:40:54,009 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:40:54,009 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:40:54,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:40:54 BoogieIcfgContainer [2025-03-04 15:40:54,010 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:40:54,011 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:40:54,011 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:40:54,015 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:40:54,016 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:40:54,016 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:40:53" (1/3) ... [2025-03-04 15:40:54,017 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4715be83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:40:54, skipping insertion in model container [2025-03-04 15:40:54,018 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:40:54,018 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:53" (2/3) ... [2025-03-04 15:40:54,018 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4715be83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:40:54, skipping insertion in model container [2025-03-04 15:40:54,018 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:40:54,018 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:40:54" (3/3) ... [2025-03-04 15:40:54,019 INFO L363 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca-2.i [2025-03-04 15:40:54,056 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:40:54,056 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:40:54,056 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:40:54,056 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:40:54,056 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:40:54,056 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:40:54,056 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:40:54,056 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:40:54,059 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-04 15:40:54,069 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-04 15:40:54,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:40:54,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:40:54,073 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:40:54,073 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:40:54,073 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:40:54,073 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-04 15:40:54,074 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-04 15:40:54,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:40:54,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:40:54,074 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:40:54,074 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:40:54,077 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~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~ret12#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet8#1;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;" "assume !(main_~length~0#1 < 1);" "assume !(main_~n~1#1 < 1);" "call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~pre2#1, cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1;" "assume 0 != cstrlcpy_~n~0#1 % 18446744073709551616;" [2025-03-04 15:40:54,077 INFO L754 eck$LassoCheckResult]: Loop: "assume true;cstrlcpy_#t~pre2#1 := cstrlcpy_~n~0#1 - 1;cstrlcpy_~n~0#1 := cstrlcpy_~n~0#1 - 1;" "assume 0 != cstrlcpy_#t~pre2#1 % 18446744073709551616;havoc cstrlcpy_#t~pre2#1;cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset := cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_#t~post3#1.base, 1 + cstrlcpy_#t~post3#1.offset;cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post4#1.base, 1 + cstrlcpy_#t~post4#1.offset;call cstrlcpy_#t~mem5#1 := read~int#1(cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, 1);call write~int#0(cstrlcpy_#t~mem5#1, cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, 1);" "assume !(0 == cstrlcpy_#t~mem5#1);havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset;havoc cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset;havoc cstrlcpy_#t~mem5#1;" [2025-03-04 15:40:54,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:54,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1774020220, now seen corresponding path program 1 times [2025-03-04 15:40:54,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:40:54,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138463934] [2025-03-04 15:40:54,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:40:54,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:40:54,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:40:54,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:40:54,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:54,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:54,185 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:40:54,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:40:54,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:40:54,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:54,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:54,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:40:54,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:54,219 INFO L85 PathProgramCache]: Analyzing trace with hash 49615, now seen corresponding path program 1 times [2025-03-04 15:40:54,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:40:54,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532734831] [2025-03-04 15:40:54,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:40:54,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:40:54,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:40:54,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:40:54,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:54,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:54,245 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:40:54,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:40:54,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:40:54,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:54,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:54,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:40:54,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:54,259 INFO L85 PathProgramCache]: Analyzing trace with hash 263816564, now seen corresponding path program 1 times [2025-03-04 15:40:54,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:40:54,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56702827] [2025-03-04 15:40:54,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:40:54,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:40:54,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:40:54,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:40:54,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:54,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:54,302 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:40:54,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:40:54,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:40:54,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:54,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:54,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:40:55,089 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:40:55,090 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:40:55,090 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:40:55,090 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:40:55,090 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:40:55,090 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:55,090 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:40:55,090 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:40:55,091 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca-2.i_Iteration1_Lasso [2025-03-04 15:40:55,091 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:40:55,091 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:40:55,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:55,909 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:40:55,911 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:40:55,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:55,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:55,913 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:55,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-04 15:40:55,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:40:55,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:55,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:55,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:55,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:55,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:55,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:55,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:55,932 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:55,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:55,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:55,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:55,942 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:55,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-04 15:40:55,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:40:55,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:55,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:55,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:55,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:55,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:55,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:55,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:55,956 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:55,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:55,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:55,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:55,963 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:55,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-04 15:40:55,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:40:55,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:55,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:55,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:55,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:55,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:40:55,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:40:55,980 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:55,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:55,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:55,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:55,988 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:55,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-04 15:40:55,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:40:56,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:56,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:56,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:56,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:56,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:56,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:56,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:56,004 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:56,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:56,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:56,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:56,011 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:56,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-04 15:40:56,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:40:56,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:56,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:56,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:56,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:56,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:56,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:56,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:56,024 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:56,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-04 15:40:56,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:56,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:56,031 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:56,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-04 15:40:56,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:40:56,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:56,042 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:56,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:56,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:56,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:56,043 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:56,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:56,044 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:56,049 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-04 15:40:56,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:56,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:56,050 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:56,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-04 15:40:56,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:40:56,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:56,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:56,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:56,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:56,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:56,062 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:56,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:56,065 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:56,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-04 15:40:56,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:56,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:56,072 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:56,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-04 15:40:56,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:40:56,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:56,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:56,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:56,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:56,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:56,085 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:56,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:56,086 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:56,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:56,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:56,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:56,093 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:56,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-04 15:40:56,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:40:56,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:56,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:56,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:56,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:56,106 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:40:56,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:40:56,109 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:56,114 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-04 15:40:56,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:56,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:56,116 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:56,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-04 15:40:56,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:40:56,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:56,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:56,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:56,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:56,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:56,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:56,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:56,130 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:56,135 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-04 15:40:56,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:56,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:56,137 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:56,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-04 15:40:56,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:40:56,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:56,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:56,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:56,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:56,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:56,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:56,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:56,154 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:56,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:56,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:56,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:56,161 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:56,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-04 15:40:56,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:40:56,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:56,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:56,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:56,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:56,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:56,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:56,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:56,179 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:56,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:56,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:56,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:56,187 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:56,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-04 15:40:56,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:40:56,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:56,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:56,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:56,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:56,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:56,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:56,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:56,203 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:56,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:56,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:56,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:56,211 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:56,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-04 15:40:56,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:40:56,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:56,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:56,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:56,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:56,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:56,225 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:56,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:56,227 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:56,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:56,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:56,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:56,235 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:56,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-04 15:40:56,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:40:56,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:56,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:56,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:56,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:56,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:40:56,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:40:56,269 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:40:56,308 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-04 15:40:56,310 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-04 15:40:56,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:56,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:56,313 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:56,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-04 15:40:56,315 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:40:56,327 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-04 15:40:56,327 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:40:56,328 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlcpy_~n~0#1, v_rep(select #length ULTIMATE.start_main_#t~malloc10#1.base)_1) = 2*ULTIMATE.start_cstrlcpy_~n~0#1 + 3*v_rep(select #length ULTIMATE.start_main_#t~malloc10#1.base)_1 Supporting invariants [3*ULTIMATE.start_cstrlcpy_~d~0#1.offset + 2*ULTIMATE.start_cstrlcpy_~n~0#1 >= 0] [2025-03-04 15:40:56,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:56,365 INFO L156 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2025-03-04 15:40:56,373 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 15:40:56,373 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 15:40:56,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:56,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:40:56,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:40:56,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:56,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:40:56,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 15:40:56,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:40:56,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:40:56,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:40:56,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:56,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:40:56,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 15:40:56,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:40:56,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:56,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:40:56,564 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2025-03-04 15:40:56,566 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. 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 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:40:56,648 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. 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 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 44 states and 62 transitions. Complement of second has 10 states. [2025-03-04 15:40:56,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:40:56,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:40:56,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2025-03-04 15:40:56,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 6 letters. Loop has 3 letters. [2025-03-04 15:40:56,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:40:56,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 9 letters. Loop has 3 letters. [2025-03-04 15:40:56,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:40:56,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 6 letters. Loop has 6 letters. [2025-03-04 15:40:56,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:40:56,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 62 transitions. [2025-03-04 15:40:56,665 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-04 15:40:56,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 22 states and 30 transitions. [2025-03-04 15:40:56,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-03-04 15:40:56,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-03-04 15:40:56,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2025-03-04 15:40:56,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:40:56,669 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2025-03-04 15:40:56,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2025-03-04 15:40:56,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 16. [2025-03-04 15:40:56,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:40:56,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2025-03-04 15:40:56,685 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-03-04 15:40:56,685 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-03-04 15:40:56,685 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:40:56,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2025-03-04 15:40:56,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:40:56,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:40:56,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:40:56,689 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:40:56,689 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:40:56,689 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~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~ret12#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet8#1;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;" "assume !(main_~length~0#1 < 1);" "assume !(main_~n~1#1 < 1);" "call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~pre2#1, cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1;" "assume !(0 != cstrlcpy_~n~0#1 % 18446744073709551616);" "assume 0 == cstrlcpy_~n~0#1 % 18446744073709551616;" "assume !(0 != cstrlcpy_~siz#1 % 18446744073709551616);" [2025-03-04 15:40:56,689 INFO L754 eck$LassoCheckResult]: Loop: "assume true;cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int#1(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1);" "assume 0 != cstrlcpy_#t~mem7#1;havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1;" [2025-03-04 15:40:56,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:56,689 INFO L85 PathProgramCache]: Analyzing trace with hash -268583748, now seen corresponding path program 1 times [2025-03-04 15:40:56,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:40:56,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019707848] [2025-03-04 15:40:56,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:40:56,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:40:56,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:40:56,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:40:56,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:56,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:40:56,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:40:56,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:40:56,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019707848] [2025-03-04 15:40:56,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019707848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:40:56,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:40:56,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:40:56,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995318289] [2025-03-04 15:40:56,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:40:56,951 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:40:56,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:56,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1215, now seen corresponding path program 1 times [2025-03-04 15:40:56,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:40:56,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120470455] [2025-03-04 15:40:56,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:40:56,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:40:56,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:40:56,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:40:56,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:56,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:56,956 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:40:56,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:40:56,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:40:56,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:56,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:56,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:40:56,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:40:56,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:40:56,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:40:56,995 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-04 15:40:57,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:40:57,007 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2025-03-04 15:40:57,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2025-03-04 15:40:57,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:40:57,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2025-03-04 15:40:57,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-04 15:40:57,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-04 15:40:57,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2025-03-04 15:40:57,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:40:57,008 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2025-03-04 15:40:57,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2025-03-04 15:40:57,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-04 15:40:57,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:40:57,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2025-03-04 15:40:57,009 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2025-03-04 15:40:57,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:40:57,010 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2025-03-04 15:40:57,010 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:40:57,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2025-03-04 15:40:57,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:40:57,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:40:57,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:40:57,011 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:40:57,011 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:40:57,011 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~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~ret12#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet8#1;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;" "assume !(main_~length~0#1 < 1);" "assume !(main_~n~1#1 < 1);" "call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~pre2#1, cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1;" "assume 0 != cstrlcpy_~n~0#1 % 18446744073709551616;" "assume true;cstrlcpy_#t~pre2#1 := cstrlcpy_~n~0#1 - 1;cstrlcpy_~n~0#1 := cstrlcpy_~n~0#1 - 1;" "assume !(0 != cstrlcpy_#t~pre2#1 % 18446744073709551616);havoc cstrlcpy_#t~pre2#1;" "assume 0 == cstrlcpy_~n~0#1 % 18446744073709551616;" "assume !(0 != cstrlcpy_~siz#1 % 18446744073709551616);" [2025-03-04 15:40:57,011 INFO L754 eck$LassoCheckResult]: Loop: "assume true;cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int#1(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1);" "assume 0 != cstrlcpy_#t~mem7#1;havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1;" [2025-03-04 15:40:57,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:57,011 INFO L85 PathProgramCache]: Analyzing trace with hash -411622151, now seen corresponding path program 1 times [2025-03-04 15:40:57,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:40:57,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398962969] [2025-03-04 15:40:57,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:40:57,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:40:57,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:40:57,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:40:57,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:57,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:40:57,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:40:57,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:40:57,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398962969] [2025-03-04 15:40:57,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398962969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:40:57,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:40:57,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:40:57,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495605071] [2025-03-04 15:40:57,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:40:57,159 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:40:57,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:57,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1215, now seen corresponding path program 2 times [2025-03-04 15:40:57,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:40:57,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181045238] [2025-03-04 15:40:57,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:40:57,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:40:57,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:40:57,163 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:40:57,163 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:40:57,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:57,163 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:40:57,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:40:57,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:40:57,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:57,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:57,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:40:57,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:40:57,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:40:57,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:40:57,196 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 8 Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:40:57,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:40:57,204 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-03-04 15:40:57,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. [2025-03-04 15:40:57,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:40:57,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 21 transitions. [2025-03-04 15:40:57,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-04 15:40:57,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-04 15:40:57,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2025-03-04 15:40:57,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:40:57,205 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-03-04 15:40:57,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2025-03-04 15:40:57,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-04 15:40:57,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:40:57,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2025-03-04 15:40:57,206 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-03-04 15:40:57,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:40:57,207 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-03-04 15:40:57,207 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:40:57,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2025-03-04 15:40:57,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:40:57,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:40:57,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:40:57,208 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:40:57,209 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:40:57,210 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~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~ret12#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet8#1;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;" "assume !(main_~length~0#1 < 1);" "assume !(main_~n~1#1 < 1);" "call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~pre2#1, cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1;" "assume 0 != cstrlcpy_~n~0#1 % 18446744073709551616;" "assume true;cstrlcpy_#t~pre2#1 := cstrlcpy_~n~0#1 - 1;cstrlcpy_~n~0#1 := cstrlcpy_~n~0#1 - 1;" "assume !(0 != cstrlcpy_#t~pre2#1 % 18446744073709551616);havoc cstrlcpy_#t~pre2#1;" "assume 0 == cstrlcpy_~n~0#1 % 18446744073709551616;" "assume 0 != cstrlcpy_~siz#1 % 18446744073709551616;call write~int#0(0, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, 1);" [2025-03-04 15:40:57,210 INFO L754 eck$LassoCheckResult]: Loop: "assume true;cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int#1(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1);" "assume 0 != cstrlcpy_#t~mem7#1;havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1;" [2025-03-04 15:40:57,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:57,210 INFO L85 PathProgramCache]: Analyzing trace with hash -411622152, now seen corresponding path program 1 times [2025-03-04 15:40:57,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:40:57,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294772617] [2025-03-04 15:40:57,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:40:57,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:40:57,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:40:57,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:40:57,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:57,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:57,227 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:40:57,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:40:57,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:40:57,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:57,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:57,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:40:57,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:57,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1215, now seen corresponding path program 3 times [2025-03-04 15:40:57,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:40:57,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632919202] [2025-03-04 15:40:57,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:40:57,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:40:57,240 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:40:57,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:40:57,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:40:57,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:57,241 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:40:57,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:40:57,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:40:57,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:57,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:57,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:40:57,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:57,243 INFO L85 PathProgramCache]: Analyzing trace with hash -431896586, now seen corresponding path program 1 times [2025-03-04 15:40:57,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:40:57,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476055844] [2025-03-04 15:40:57,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:40:57,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:40:57,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:40:57,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:40:57,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:57,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:57,265 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:40:57,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:40:57,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:40:57,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:57,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:57,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:40:58,045 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:40:58,046 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:40:58,046 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:40:58,046 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:40:58,046 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:40:58,046 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:58,046 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:40:58,046 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:40:58,046 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca-2.i_Iteration4_Lasso [2025-03-04 15:40:58,046 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:40:58,046 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:40:58,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:58,438 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:40:58,438 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:40:58,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:58,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:58,441 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:58,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-04 15:40:58,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:40:58,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:58,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:58,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:58,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:58,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:40:58,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:40:58,456 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:58,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-04 15:40:58,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:58,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:58,467 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:58,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-04 15:40:58,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:40:58,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:58,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:58,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:58,480 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:40:58,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:58,481 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-04 15:40:58,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:58,483 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:58,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:58,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:58,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:58,490 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:58,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-04 15:40:58,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:40:58,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:58,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:58,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:58,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:58,506 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:40:58,506 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:40:58,511 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:58,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-04 15:40:58,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:58,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:58,518 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:58,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-04 15:40:58,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:40:58,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:58,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:58,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:58,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:58,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:40:58,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:40:58,534 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:58,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-04 15:40:58,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:58,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:58,541 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:58,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-04 15:40:58,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:40:58,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:58,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:58,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:58,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:58,555 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:40:58,555 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:40:58,557 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:58,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-04 15:40:58,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:58,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:58,564 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:58,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-04 15:40:58,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:40:58,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:58,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:58,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:58,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:58,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:40:58,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:40:58,584 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:58,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:58,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:58,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:58,592 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:58,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-04 15:40:58,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:40:58,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:58,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:58,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:58,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:58,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:40:58,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:40:58,608 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:58,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:58,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:58,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:58,616 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:58,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-04 15:40:58,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:40:58,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:58,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:58,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:58,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:58,630 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:40:58,630 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:40:58,633 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:58,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:58,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:58,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:58,641 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:58,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-04 15:40:58,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:40:58,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:58,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:58,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:58,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:58,656 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:40:58,656 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:40:58,662 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:40:58,675 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-04 15:40:58,675 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-04 15:40:58,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:58,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:58,681 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:40:58,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-04 15:40:58,683 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:40:58,694 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:40:58,694 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:40:58,694 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlcpy_~s~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc11#1.base)_2) = -1*ULTIMATE.start_cstrlcpy_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11#1.base)_2 Supporting invariants [] [2025-03-04 15:40:58,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:58,710 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2025-03-04 15:40:58,712 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 15:40:58,712 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 15:40:58,712 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-04 15:40:58,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:58,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:40:58,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:40:58,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:58,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:40:58,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:40:58,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:40:58,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:40:58,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:40:58,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:58,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:40:58,780 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:40:58,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:40:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:40:58,799 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-03-04 15:40:58,800 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:40:58,819 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 7. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 18 states and 23 transitions. Complement of second has 5 states. [2025-03-04 15:40:58,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:40:58,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:40:58,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2025-03-04 15:40:58,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 2 letters. [2025-03-04 15:40:58,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:40:58,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 12 letters. Loop has 2 letters. [2025-03-04 15:40:58,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:40:58,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 4 letters. [2025-03-04 15:40:58,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:40:58,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2025-03-04 15:40:58,824 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:40:58,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2025-03-04 15:40:58,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:40:58,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:40:58,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:40:58,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:40:58,825 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:40:58,825 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:40:58,825 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:40:58,825 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:40:58,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 15:40:58,825 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:40:58,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 15:40:58,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:40:58 BoogieIcfgContainer [2025-03-04 15:40:58,835 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:40:58,836 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:40:58,836 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:40:58,836 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:40:58,837 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:40:54" (3/4) ... [2025-03-04 15:40:58,838 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 15:40:58,839 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:40:58,839 INFO L158 Benchmark]: Toolchain (without parser) took 5390.46ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 108.6MB in the beginning and 142.4MB in the end (delta: -33.8MB). Peak memory consumption was 113.4MB. Max. memory is 16.1GB. [2025-03-04 15:40:58,840 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:40:58,841 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.23ms. Allocated memory is still 142.6MB. Free memory was 108.6MB in the beginning and 92.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:40:58,841 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.55ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 89.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:40:58,841 INFO L158 Benchmark]: Boogie Preprocessor took 21.03ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 88.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:40:58,841 INFO L158 Benchmark]: IcfgBuilder took 264.46ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 75.3MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:40:58,842 INFO L158 Benchmark]: BuchiAutomizer took 4824.63ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 75.3MB in the beginning and 142.5MB in the end (delta: -67.1MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. [2025-03-04 15:40:58,842 INFO L158 Benchmark]: Witness Printer took 3.00ms. Allocated memory is still 285.2MB. Free memory was 142.5MB in the beginning and 142.4MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:40:58,843 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.14ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.23ms. Allocated memory is still 142.6MB. Free memory was 108.6MB in the beginning and 92.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.55ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 89.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.03ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 88.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 264.46ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 75.3MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 4824.63ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 75.3MB in the beginning and 142.5MB in the end (delta: -67.1MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. * Witness Printer took 3.00ms. Allocated memory is still 285.2MB. Free memory was 142.5MB in the beginning and 142.4MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 7 locations. 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 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.7s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 6 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 143 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 63 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital192 mio100 ax109 hnf100 lsp89 ukn70 mio100 lsp36 div166 bol100 ite100 ukn100 eq156 hnf93 smp78 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-04 15:40:58,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-04 15:40:59,057 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