./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f2e994fbd4308fecf33fa0184f8cdc44b0ef95d4019fc8f460440561d10a29a6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:56:15,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:56:15,920 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-09 06:56:15,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:56:15,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:56:15,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 06:56:15,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:56:15,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:56:15,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:56:15,946 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:56:15,946 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:56:15,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:56:15,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:56:15,947 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:56:15,948 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 06:56:15,948 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 06:56:15,948 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 06:56:15,948 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 06:56:15,948 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 06:56:15,948 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 06:56:15,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:56:15,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 06:56:15,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:56:15,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:56:15,948 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 06:56:15,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 06:56:15,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 06:56:15,949 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:56:15,949 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:56:15,949 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 06:56:15,949 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:56:15,949 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:56:15,950 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:56:15,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:56:15,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:56:15,950 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:56:15,950 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 06:56:15,950 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 -> f2e994fbd4308fecf33fa0184f8cdc44b0ef95d4019fc8f460440561d10a29a6 [2025-03-09 06:56:16,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:56:16,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:56:16,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:56:16,178 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:56:16,178 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:56:16,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca.i [2025-03-09 06:56:17,302 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84a471c0a/a56d0af8c4554aac87c6053a23b4d271/FLAG2a52916c1 [2025-03-09 06:56:17,595 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:56:17,597 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca.i [2025-03-09 06:56:17,607 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84a471c0a/a56d0af8c4554aac87c6053a23b4d271/FLAG2a52916c1 [2025-03-09 06:56:17,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84a471c0a/a56d0af8c4554aac87c6053a23b4d271 [2025-03-09 06:56:17,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:56:17,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:56:17,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:56:17,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:56:17,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:56:17,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:56:17" (1/1) ... [2025-03-09 06:56:17,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@736f61e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:17, skipping insertion in model container [2025-03-09 06:56:17,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:56:17" (1/1) ... [2025-03-09 06:56:17,921 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:56:18,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:56:18,146 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:56:18,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:56:18,210 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:56:18,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:18 WrapperNode [2025-03-09 06:56:18,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:56:18,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:56:18,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:56:18,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:56:18,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:18" (1/1) ... [2025-03-09 06:56:18,227 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:18" (1/1) ... [2025-03-09 06:56:18,243 INFO L138 Inliner]: procedures = 152, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2025-03-09 06:56:18,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:56:18,244 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:56:18,244 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:56:18,244 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:56:18,249 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:18" (1/1) ... [2025-03-09 06:56:18,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:18" (1/1) ... [2025-03-09 06:56:18,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:18" (1/1) ... [2025-03-09 06:56:18,261 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [3, 4]. 57 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2025-03-09 06:56:18,261 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:18" (1/1) ... [2025-03-09 06:56:18,262 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:18" (1/1) ... [2025-03-09 06:56:18,265 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:18" (1/1) ... [2025-03-09 06:56:18,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:18" (1/1) ... [2025-03-09 06:56:18,266 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:18" (1/1) ... [2025-03-09 06:56:18,267 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:18" (1/1) ... [2025-03-09 06:56:18,268 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:56:18,268 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:56:18,268 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:56:18,268 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:56:18,269 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:18" (1/1) ... [2025-03-09 06:56:18,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:18,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:18,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:18,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-09 06:56:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:56:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:56:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:56:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:56:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 06:56:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:56:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:56:18,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:56:18,365 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:56:18,366 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:56:18,523 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L393: havoc main_#t~ret217#1;call ULTIMATE.dealloc(main_#t~malloc215#1.base, main_#t~malloc215#1.offset);havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call ULTIMATE.dealloc(main_#t~malloc216#1.base, main_#t~malloc216#1.offset);havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset; [2025-03-09 06:56:18,539 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-09 06:56:18,540 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:56:18,547 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:56:18,547 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:56:18,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:56:18 BoogieIcfgContainer [2025-03-09 06:56:18,548 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:56:18,549 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 06:56:18,549 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 06:56:18,552 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 06:56:18,553 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:56:18,554 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 06:56:17" (1/3) ... [2025-03-09 06:56:18,555 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ccb6724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:56:18, skipping insertion in model container [2025-03-09 06:56:18,555 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:56:18,555 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:18" (2/3) ... [2025-03-09 06:56:18,555 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ccb6724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:56:18, skipping insertion in model container [2025-03-09 06:56:18,555 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:56:18,555 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:56:18" (3/3) ... [2025-03-09 06:56:18,556 INFO L363 chiAutomizerObserver]: Analyzing ICFG cstrcspn_mixed_alloca.i [2025-03-09 06:56:18,595 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 06:56:18,595 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 06:56:18,595 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 06:56:18,596 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 06:56:18,596 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 06:56:18,596 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 06:56:18,596 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 06:56:18,597 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 06:56:18,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:18,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-09 06:56:18,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:18,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:18,617 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 06:56:18,617 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 06:56:18,617 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 06:56:18,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:18,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-09 06:56:18,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:18,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:18,619 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 06:56:18,620 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 06:56:18,624 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem205#1, cstrcspn_#t~mem206#1, cstrcspn_#t~mem207#1, cstrcspn_#t~mem208#1, cstrcspn_#t~short209#1, cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset, cstrcspn_#t~mem211#1, cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset;" [2025-03-09 06:56:18,624 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrcspn_#t~mem205#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);" "assume 0 != cstrcspn_#t~mem205#1;havoc cstrcspn_#t~mem205#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem206#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem206#1;havoc cstrcspn_#t~mem206#1;" "assume !true;" "call cstrcspn_#t~mem211#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);" "assume !(cstrcspn_#t~mem211#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem211#1;cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post212#1.base, 1 + cstrcspn_#t~post212#1.offset;havoc cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset;" [2025-03-09 06:56:18,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:18,629 INFO L85 PathProgramCache]: Analyzing trace with hash 59135068, now seen corresponding path program 1 times [2025-03-09 06:56:18,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:18,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654258966] [2025-03-09 06:56:18,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:56:18,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:18,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:56:18,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:56:18,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:18,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:18,718 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:18,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:56:18,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:56:18,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:18,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:18,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:18,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:18,748 INFO L85 PathProgramCache]: Analyzing trace with hash 51497458, now seen corresponding path program 1 times [2025-03-09 06:56:18,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:18,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119064038] [2025-03-09 06:56:18,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:56:18,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:18,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:56:18,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:56:18,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:18,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:18,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:18,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:56:18,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119064038] [2025-03-09 06:56:18,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119064038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:56:18,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:56:18,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:56:18,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676636247] [2025-03-09 06:56:18,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:56:18,788 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:56:18,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:56:18,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 06:56:18,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 06:56:18,813 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:18,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:56:18,818 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-03-09 06:56:18,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2025-03-09 06:56:18,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-09 06:56:18,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 16 transitions. [2025-03-09 06:56:18,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-09 06:56:18,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-03-09 06:56:18,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2025-03-09 06:56:18,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:56:18,824 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-03-09 06:56:18,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2025-03-09 06:56:18,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-09 06:56:18,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:18,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2025-03-09 06:56:18,839 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-03-09 06:56:18,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 06:56:18,842 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-03-09 06:56:18,842 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 06:56:18,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2025-03-09 06:56:18,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-09 06:56:18,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:18,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:18,843 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 06:56:18,843 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:56:18,843 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem205#1, cstrcspn_#t~mem206#1, cstrcspn_#t~mem207#1, cstrcspn_#t~mem208#1, cstrcspn_#t~short209#1, cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset, cstrcspn_#t~mem211#1, cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset;" [2025-03-09 06:56:18,843 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrcspn_#t~mem205#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);" "assume 0 != cstrcspn_#t~mem205#1;havoc cstrcspn_#t~mem205#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem206#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem206#1;havoc cstrcspn_#t~mem206#1;" "assume true;call cstrcspn_#t~mem207#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := 0 != cstrcspn_#t~mem207#1;" "assume cstrcspn_#t~short209#1;call cstrcspn_#t~mem208#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := cstrcspn_#t~mem208#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256);" "assume !cstrcspn_#t~short209#1;havoc cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~short209#1;" "call cstrcspn_#t~mem211#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);" "assume !(cstrcspn_#t~mem211#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem211#1;cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post212#1.base, 1 + cstrcspn_#t~post212#1.offset;havoc cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset;" [2025-03-09 06:56:18,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:18,846 INFO L85 PathProgramCache]: Analyzing trace with hash 59135068, now seen corresponding path program 2 times [2025-03-09 06:56:18,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:18,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036072472] [2025-03-09 06:56:18,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:56:18,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:18,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:56:18,874 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:56:18,874 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:56:18,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:18,875 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:18,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:56:18,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:56:18,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:18,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:18,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:18,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:18,892 INFO L85 PathProgramCache]: Analyzing trace with hash -2051320785, now seen corresponding path program 1 times [2025-03-09 06:56:18,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:18,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000384303] [2025-03-09 06:56:18,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:56:18,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:18,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:56:18,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:56:18,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:18,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:18,917 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:18,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:56:18,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:56:18,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:18,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:18,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:18,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:18,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1866036084, now seen corresponding path program 1 times [2025-03-09 06:56:18,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:18,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137240947] [2025-03-09 06:56:18,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:56:18,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:18,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:56:18,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:56:18,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:18,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:18,974 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:18,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:56:18,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:56:18,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:18,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:19,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:19,779 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:56:19,780 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:56:19,780 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:56:19,781 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:56:19,781 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:56:19,781 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:19,781 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:56:19,781 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:56:19,781 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca.i_Iteration2_Lasso [2025-03-09 06:56:19,782 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:56:19,782 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:56:19,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:19,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:19,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:19,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:19,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:19,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:19,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:19,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:19,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:19,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:19,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:19,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:19,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:19,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:20,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:20,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:20,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:20,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:20,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:20,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:20,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:20,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:20,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:20,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:20,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:20,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:20,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:20,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:20,705 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:56:20,708 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:56:20,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:20,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:20,714 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:20,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-09 06:56:20,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:20,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:20,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:20,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:20,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:20,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:20,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:20,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:20,736 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:20,745 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-09 06:56:20,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:20,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:20,747 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:20,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-09 06:56:20,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:20,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:20,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:20,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:20,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:20,764 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:20,764 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:20,766 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:20,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-09 06:56:20,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:20,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:20,774 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:20,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-09 06:56:20,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:20,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:20,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:20,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:20,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:20,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:20,787 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:20,787 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:20,788 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:20,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-09 06:56:20,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:20,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:20,796 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:20,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-09 06:56:20,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:20,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:20,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:20,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:20,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:20,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:20,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:20,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:20,809 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:20,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-09 06:56:20,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:20,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:20,817 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:20,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-09 06:56:20,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:20,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:20,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:20,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:20,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:20,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:20,830 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:20,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:20,831 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:20,836 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-09 06:56:20,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:20,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:20,838 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:20,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-09 06:56:20,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:20,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:20,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:20,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:20,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:20,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:20,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:20,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:20,853 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:20,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-09 06:56:20,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:20,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:20,860 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:20,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-09 06:56:20,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:20,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:20,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:20,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:20,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:20,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:20,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:20,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:20,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:20,884 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-09 06:56:20,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:20,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:20,886 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:20,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-09 06:56:20,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:20,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:20,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:20,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:20,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:20,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:20,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:20,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:20,900 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:20,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-09 06:56:20,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:20,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:20,908 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:20,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-09 06:56:20,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:20,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:20,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:20,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:20,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:20,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:20,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:20,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:20,922 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:20,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-09 06:56:20,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:20,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:20,930 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:20,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-09 06:56:20,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:20,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:20,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:20,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:20,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:20,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:20,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:20,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:20,943 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:20,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-09 06:56:20,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:20,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:20,950 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:20,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-09 06:56:20,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:20,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:20,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:20,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:20,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:20,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:20,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:20,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:20,964 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:20,969 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-09 06:56:20,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:20,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:20,971 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:20,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-09 06:56:20,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:20,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:20,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:20,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:20,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:20,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:20,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:20,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:20,984 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:20,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-09 06:56:20,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:20,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:20,992 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:20,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-09 06:56:20,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:21,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:21,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:21,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:21,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:21,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:21,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:21,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:21,006 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:21,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-09 06:56:21,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:21,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:21,013 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:21,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-09 06:56:21,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-09 06:56:21,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:21,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:21,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:21,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:21,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:21,028 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:21,034 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:21,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-09 06:56:21,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:21,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:21,043 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:21,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-09 06:56:21,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:21,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:21,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:21,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:21,056 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-03-09 06:56:21,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:21,059 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-09 06:56:21,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:21,065 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:21,073 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-09 06:56:21,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:21,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:21,076 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-09 06:56:21,078 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-09 06:56:21,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:21,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:21,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:21,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:21,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:21,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:21,097 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:21,106 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:56:21,131 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-09 06:56:21,132 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-03-09 06:56:21,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:21,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:21,138 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-09 06:56:21,139 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-09 06:56:21,141 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:56:21,152 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:56:21,152 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:56:21,152 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~sc1~0#1.offset, v_rep(select #length ULTIMATE.start_cstrcspn_~sc1~0#1.base)_1) = -1*ULTIMATE.start_cstrcspn_~sc1~0#1.offset + 1*v_rep(select #length ULTIMATE.start_cstrcspn_~sc1~0#1.base)_1 Supporting invariants [] [2025-03-09 06:56:21,158 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-09 06:56:21,198 INFO L156 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2025-03-09 06:56:21,203 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sc1~0!offset [2025-03-09 06:56:21,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-09 06:56:21,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-09 06:56:21,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:21,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:56:21,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:56:21,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:21,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:21,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:56:21,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:21,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:56:21,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:56:21,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:21,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:21,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:56:21,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:21,323 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-09 06:56:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:21,334 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 06:56:21,335 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-09 06:56:21,374 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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 19 states and 26 transitions. Complement of second has 4 states. [2025-03-09 06:56:21,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 06:56:21,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-09 06:56:21,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2025-03-09 06:56:21,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 7 letters. [2025-03-09 06:56:21,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:21,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 12 letters. Loop has 7 letters. [2025-03-09 06:56:21,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:21,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 14 letters. [2025-03-09 06:56:21,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:21,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2025-03-09 06:56:21,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:56:21,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 24 transitions. [2025-03-09 06:56:21,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:56:21,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-09 06:56:21,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2025-03-09 06:56:21,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:56:21,384 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 24 transitions. [2025-03-09 06:56:21,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2025-03-09 06:56:21,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-09 06:56:21,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:21,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2025-03-09 06:56:21,386 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 24 transitions. [2025-03-09 06:56:21,386 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2025-03-09 06:56:21,386 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 06:56:21,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2025-03-09 06:56:21,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:56:21,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:21,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:21,386 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:56:21,387 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:56:21,387 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem205#1, cstrcspn_#t~mem206#1, cstrcspn_#t~mem207#1, cstrcspn_#t~mem208#1, cstrcspn_#t~short209#1, cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset, cstrcspn_#t~mem211#1, cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset;" "assume true;call cstrcspn_#t~mem205#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);" "assume 0 != cstrcspn_#t~mem205#1;havoc cstrcspn_#t~mem205#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem206#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem206#1;havoc cstrcspn_#t~mem206#1;" [2025-03-09 06:56:21,387 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrcspn_#t~mem207#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := 0 != cstrcspn_#t~mem207#1;" "assume cstrcspn_#t~short209#1;call cstrcspn_#t~mem208#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := cstrcspn_#t~mem208#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256);" "assume cstrcspn_#t~short209#1;havoc cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~short209#1;cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset - 1;" [2025-03-09 06:56:21,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:21,387 INFO L85 PathProgramCache]: Analyzing trace with hash 994226267, now seen corresponding path program 1 times [2025-03-09 06:56:21,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:21,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334055403] [2025-03-09 06:56:21,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:56:21,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:21,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:56:21,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:56:21,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:21,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:21,404 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:21,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:56:21,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:56:21,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:21,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:21,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:21,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:21,421 INFO L85 PathProgramCache]: Analyzing trace with hash 47600, now seen corresponding path program 1 times [2025-03-09 06:56:21,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:21,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304941679] [2025-03-09 06:56:21,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:56:21,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:21,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:56:21,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:56:21,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:21,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:21,427 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:21,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:56:21,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:56:21,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:21,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:21,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:21,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:21,431 INFO L85 PathProgramCache]: Analyzing trace with hash 900264790, now seen corresponding path program 1 times [2025-03-09 06:56:21,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:21,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826152392] [2025-03-09 06:56:21,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:56:21,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:21,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:56:21,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:56:21,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:21,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:21,458 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:21,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:56:21,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:56:21,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:21,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:21,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:22,017 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:56:22,017 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:56:22,017 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:56:22,017 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:56:22,017 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:56:22,017 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:22,017 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:56:22,017 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:56:22,017 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca.i_Iteration3_Lasso [2025-03-09 06:56:22,017 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:56:22,017 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:56:22,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:22,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:22,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:22,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:22,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:22,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:22,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:22,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:22,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:22,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:22,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:22,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:22,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:22,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:22,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:22,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:22,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:22,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:22,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:22,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:22,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:22,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:22,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:22,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:22,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:22,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:22,678 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:56:22,678 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:56:22,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:22,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:22,682 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-09 06:56:22,683 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-09 06:56:22,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:22,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:22,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:22,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:22,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:22,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:22,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:22,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:22,697 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:22,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-09 06:56:22,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:22,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:22,704 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-09 06:56:22,705 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-09 06:56:22,706 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:22,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:22,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:22,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:22,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:22,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:22,716 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:22,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:22,717 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:22,722 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-09 06:56:22,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:22,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:22,725 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-09 06:56:22,726 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-09 06:56:22,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:22,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:22,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:22,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:22,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:22,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:22,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:22,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:22,739 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:22,744 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-09 06:56:22,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:22,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:22,746 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-09 06:56:22,746 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-09 06:56:22,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:22,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:22,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:22,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:22,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:22,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:22,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:22,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:22,758 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:22,764 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-09 06:56:22,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:22,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:22,766 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-09 06:56:22,768 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-09 06:56:22,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:22,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:22,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:22,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:22,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:22,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:22,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:22,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:22,780 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:22,786 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-09 06:56:22,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:22,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:22,788 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-09 06:56:22,789 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-09 06:56:22,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:22,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:22,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:22,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:22,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:22,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:22,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:22,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:22,801 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:22,807 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-09 06:56:22,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:22,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:22,811 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-09 06:56:22,813 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-09 06:56:22,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:22,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:22,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:22,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:22,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:22,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:22,824 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:22,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:22,825 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:22,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-09 06:56:22,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:22,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:22,833 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-09 06:56:22,833 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-09 06:56:22,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:22,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:22,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:22,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:22,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:22,845 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:22,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:22,847 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:22,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-09 06:56:22,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:22,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:22,855 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-09 06:56:22,856 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-09 06:56:22,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:22,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:22,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:22,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:22,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:22,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:22,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:22,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:22,868 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:22,874 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-09 06:56:22,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:22,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:22,877 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:22,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-09 06:56:22,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:22,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:22,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:22,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:22,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:22,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:22,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:22,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:22,890 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:22,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-09 06:56:22,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:22,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:22,897 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:22,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-09 06:56:22,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:22,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:22,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:22,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:22,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:22,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:22,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:22,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:22,910 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:22,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-09 06:56:22,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:22,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:22,917 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:22,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-09 06:56:22,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:22,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:22,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:22,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:22,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:22,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:22,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:22,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:22,930 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:22,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-09 06:56:22,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:22,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:22,937 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:22,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-09 06:56:22,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:22,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:22,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:22,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:22,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:22,953 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:22,953 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:22,960 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:56:22,967 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-03-09 06:56:22,967 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-03-09 06:56:22,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:22,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:22,969 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:22,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-09 06:56:22,970 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:56:22,981 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:56:22,981 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:56:22,981 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0#1.offset) = 2*ULTIMATE.start_cstrcspn_~s~0#1.offset + 1 Supporting invariants [] [2025-03-09 06:56:22,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-09 06:56:23,002 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2025-03-09 06:56:23,004 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-09 06:56:23,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:23,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:56:23,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:56:23,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:23,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:23,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:56:23,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:23,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:56:23,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:56:23,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:23,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:23,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:56:23,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:23,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:23,059 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 06:56:23,059 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:23,072 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) Result 32 states and 45 transitions. Complement of second has 5 states. [2025-03-09 06:56:23,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 06:56:23,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:23,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2025-03-09 06:56:23,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 3 letters. [2025-03-09 06:56:23,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:23,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 3 letters. [2025-03-09 06:56:23,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:23,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 6 letters. [2025-03-09 06:56:23,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:23,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2025-03-09 06:56:23,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:56:23,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 24 states and 33 transitions. [2025-03-09 06:56:23,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 06:56:23,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-09 06:56:23,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2025-03-09 06:56:23,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:56:23,074 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 33 transitions. [2025-03-09 06:56:23,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2025-03-09 06:56:23,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-03-09 06:56:23,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2025-03-09 06:56:23,076 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 32 transitions. [2025-03-09 06:56:23,076 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2025-03-09 06:56:23,076 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 06:56:23,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2025-03-09 06:56:23,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:56:23,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:23,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:23,076 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:56:23,076 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:56:23,076 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem205#1, cstrcspn_#t~mem206#1, cstrcspn_#t~mem207#1, cstrcspn_#t~mem208#1, cstrcspn_#t~short209#1, cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset, cstrcspn_#t~mem211#1, cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset;" "assume true;call cstrcspn_#t~mem205#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);" "assume 0 != cstrcspn_#t~mem205#1;havoc cstrcspn_#t~mem205#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem206#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem206#1;havoc cstrcspn_#t~mem206#1;" "assume true;call cstrcspn_#t~mem207#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := 0 != cstrcspn_#t~mem207#1;" "assume !cstrcspn_#t~short209#1;" "assume !cstrcspn_#t~short209#1;havoc cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~short209#1;" "call cstrcspn_#t~mem211#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);" "assume !(cstrcspn_#t~mem211#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem211#1;cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post212#1.base, 1 + cstrcspn_#t~post212#1.offset;havoc cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset;" "assume true;call cstrcspn_#t~mem205#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);" "assume 0 != cstrcspn_#t~mem205#1;havoc cstrcspn_#t~mem205#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem206#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem206#1;havoc cstrcspn_#t~mem206#1;" [2025-03-09 06:56:23,077 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrcspn_#t~mem207#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := 0 != cstrcspn_#t~mem207#1;" "assume cstrcspn_#t~short209#1;call cstrcspn_#t~mem208#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := cstrcspn_#t~mem208#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256);" "assume cstrcspn_#t~short209#1;havoc cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~short209#1;cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset - 1;" [2025-03-09 06:56:23,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:23,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2007023086, now seen corresponding path program 1 times [2025-03-09 06:56:23,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:23,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27000139] [2025-03-09 06:56:23,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:56:23,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:23,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:56:23,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:56:23,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:23,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:23,091 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:23,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:56:23,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:56:23,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:23,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:23,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:23,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:23,102 INFO L85 PathProgramCache]: Analyzing trace with hash 47600, now seen corresponding path program 2 times [2025-03-09 06:56:23,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:23,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56326566] [2025-03-09 06:56:23,102 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:56:23,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:23,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:56:23,107 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:56:23,107 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:56:23,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:23,107 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:23,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:56:23,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:56:23,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:23,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:23,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:23,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:23,114 INFO L85 PathProgramCache]: Analyzing trace with hash -985009601, now seen corresponding path program 1 times [2025-03-09 06:56:23,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:23,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708350996] [2025-03-09 06:56:23,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:56:23,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:23,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:56:23,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:56:23,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:23,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:23,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-09 06:56:23,333 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:23,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:56:23,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708350996] [2025-03-09 06:56:23,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708350996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:56:23,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649447236] [2025-03-09 06:56:23,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:56:23,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:56:23,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:23,336 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:56:23,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-09 06:56:23,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:56:23,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:56:23,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:23,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:23,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-09 06:56:23,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:23,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 06:56:23,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-09 06:56:23,438 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:23,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:56:23,484 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:23,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649447236] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:56:23,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:56:23,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2025-03-09 06:56:23,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452994855] [2025-03-09 06:56:23,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:56:23,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:56:23,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 06:56:23,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-09 06:56:23,569 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 12 Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:23,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:56:23,655 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2025-03-09 06:56:23,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 64 transitions. [2025-03-09 06:56:23,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:56:23,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 37 states and 46 transitions. [2025-03-09 06:56:23,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-09 06:56:23,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-09 06:56:23,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2025-03-09 06:56:23,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:56:23,657 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 46 transitions. [2025-03-09 06:56:23,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2025-03-09 06:56:23,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2025-03-09 06:56:23,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:23,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2025-03-09 06:56:23,659 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-03-09 06:56:23,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 06:56:23,660 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-03-09 06:56:23,660 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 06:56:23,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2025-03-09 06:56:23,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:56:23,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:23,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:23,661 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:56:23,661 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:56:23,661 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem205#1, cstrcspn_#t~mem206#1, cstrcspn_#t~mem207#1, cstrcspn_#t~mem208#1, cstrcspn_#t~short209#1, cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset, cstrcspn_#t~mem211#1, cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset;" "assume true;call cstrcspn_#t~mem205#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);" "assume 0 != cstrcspn_#t~mem205#1;havoc cstrcspn_#t~mem205#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem206#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem206#1;havoc cstrcspn_#t~mem206#1;" "assume true;call cstrcspn_#t~mem207#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := 0 != cstrcspn_#t~mem207#1;" "assume cstrcspn_#t~short209#1;call cstrcspn_#t~mem208#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := cstrcspn_#t~mem208#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256);" "assume !cstrcspn_#t~short209#1;havoc cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~short209#1;" "call cstrcspn_#t~mem211#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);" "assume !(cstrcspn_#t~mem211#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem211#1;cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post212#1.base, 1 + cstrcspn_#t~post212#1.offset;havoc cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset;" "assume true;call cstrcspn_#t~mem205#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);" "assume 0 != cstrcspn_#t~mem205#1;havoc cstrcspn_#t~mem205#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem206#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem206#1;havoc cstrcspn_#t~mem206#1;" [2025-03-09 06:56:23,662 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrcspn_#t~mem207#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := 0 != cstrcspn_#t~mem207#1;" "assume cstrcspn_#t~short209#1;call cstrcspn_#t~mem208#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := cstrcspn_#t~mem208#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256);" "assume cstrcspn_#t~short209#1;havoc cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~short209#1;cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset - 1;" [2025-03-09 06:56:23,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:23,662 INFO L85 PathProgramCache]: Analyzing trace with hash -2035652237, now seen corresponding path program 2 times [2025-03-09 06:56:23,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:23,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577324971] [2025-03-09 06:56:23,662 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:56:23,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:23,670 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-09 06:56:23,685 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:56:23,685 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:56:23,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:23,686 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:23,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:56:23,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:56:23,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:23,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:23,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:23,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:23,702 INFO L85 PathProgramCache]: Analyzing trace with hash 47600, now seen corresponding path program 3 times [2025-03-09 06:56:23,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:23,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165263370] [2025-03-09 06:56:23,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:56:23,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:23,706 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:56:23,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:56:23,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:56:23,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:23,710 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:23,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:56:23,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:56:23,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:23,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:23,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:23,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:23,714 INFO L85 PathProgramCache]: Analyzing trace with hash 822444862, now seen corresponding path program 1 times [2025-03-09 06:56:23,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:23,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087333331] [2025-03-09 06:56:23,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:56:23,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:23,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:56:23,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:56:23,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:23,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:23,734 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:23,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:56:23,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:56:23,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:23,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:23,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:25,005 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:56:25,005 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:56:25,005 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:56:25,005 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:56:25,005 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:56:25,005 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:25,005 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:56:25,005 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:56:25,005 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca.i_Iteration5_Lasso [2025-03-09 06:56:25,005 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:56:25,005 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:56:25,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:25,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:25,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:25,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:25,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:25,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:25,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:25,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:25,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:25,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:25,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:25,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:25,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:25,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:25,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:25,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:25,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:25,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:25,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:25,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:25,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:25,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:25,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:25,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:26,116 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:56:26,117 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:56:26,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:26,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:26,119 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:26,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-09 06:56:26,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:26,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:26,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:26,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:26,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:26,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:26,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:26,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:26,136 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:26,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-09 06:56:26,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:26,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:26,144 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:26,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-09 06:56:26,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:26,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:26,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:26,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:26,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:26,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:26,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:26,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:26,157 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:26,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-09 06:56:26,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:26,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:26,164 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:26,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-09 06:56:26,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:26,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:26,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:26,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:26,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:26,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:26,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:26,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:26,176 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:26,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-09 06:56:26,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:26,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:26,184 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:26,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-09 06:56:26,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:26,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:26,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:26,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:26,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:26,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:26,196 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:26,196 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:26,197 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:26,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-09 06:56:26,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:26,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:26,204 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:26,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-09 06:56:26,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:26,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:26,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:26,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:26,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:26,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:26,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:26,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:26,218 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:26,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-09 06:56:26,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:26,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:26,226 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:26,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-09 06:56:26,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:26,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:26,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:26,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:26,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:26,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:26,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:26,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:26,243 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:26,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-03-09 06:56:26,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:26,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:26,251 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:26,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-09 06:56:26,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:26,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:26,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:26,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:26,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:26,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:26,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:26,264 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:26,265 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:26,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-09 06:56:26,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:26,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:26,273 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:26,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-09 06:56:26,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:26,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:26,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:26,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:26,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:26,290 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:26,290 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:26,294 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:26,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-03-09 06:56:26,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:26,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:26,303 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:26,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-09 06:56:26,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:26,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:26,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:26,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:26,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:26,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:26,316 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:26,318 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:26,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-03-09 06:56:26,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:26,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:26,325 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:26,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-09 06:56:26,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:26,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:26,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:26,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:26,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:26,339 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:26,339 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:26,343 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:26,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-09 06:56:26,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:26,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:26,359 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:26,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-09 06:56:26,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:26,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:26,374 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2025-03-09 06:56:26,374 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2025-03-09 06:56:26,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:26,460 INFO L401 nArgumentSynthesizer]: We have 180 Motzkin's Theorem applications. [2025-03-09 06:56:26,461 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2025-03-09 06:56:26,605 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:26,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-09 06:56:26,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:26,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:26,618 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:26,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-09 06:56:26,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:26,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:26,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:26,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:26,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:26,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:26,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:26,642 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:56:26,668 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-03-09 06:56:26,668 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-03-09 06:56:26,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:26,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:26,670 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:26,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-09 06:56:26,674 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:56:26,686 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:56:26,686 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:56:26,686 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216#1.base)_3, ULTIMATE.start_cstrcspn_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216#1.base)_3 + 2*ULTIMATE.start_cstrcspn_~s~0#1.offset Supporting invariants [] [2025-03-09 06:56:26,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-09 06:56:26,728 INFO L156 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2025-03-09 06:56:26,729 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-09 06:56:26,729 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-09 06:56:26,730 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-09 06:56:26,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:26,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:56:26,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:56:26,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:26,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:26,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:56:26,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:26,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-03-09 06:56:26,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:56:26,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:56:26,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:26,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:26,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 06:56:26,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:26,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:26,853 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-09 06:56:26,853 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:26,889 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 35 states and 46 transitions. Complement of second has 6 states. [2025-03-09 06:56:26,889 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-09 06:56:26,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:26,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2025-03-09 06:56:26,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-09 06:56:26,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:26,890 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:56:26,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:26,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:56:26,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:56:26,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:26,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:26,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:56:26,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:26,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:56:26,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:56:26,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:26,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:26,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 06:56:26,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:26,989 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2025-03-09 06:56:26,989 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:27,024 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 35 states and 46 transitions. Complement of second has 6 states. [2025-03-09 06:56:27,027 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-09 06:56:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:27,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2025-03-09 06:56:27,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-09 06:56:27,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:27,028 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:56:27,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:27,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:56:27,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:56:27,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:27,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:27,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:56:27,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:27,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:56:27,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:56:27,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:27,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:27,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 06:56:27,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:27,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:27,119 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-03-09 06:56:27,120 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:27,154 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 39 states and 54 transitions. Complement of second has 5 states. [2025-03-09 06:56:27,154 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-09 06:56:27,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:27,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2025-03-09 06:56:27,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-09 06:56:27,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:27,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 17 letters. Loop has 3 letters. [2025-03-09 06:56:27,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:27,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 14 letters. Loop has 6 letters. [2025-03-09 06:56:27,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:27,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 54 transitions. [2025-03-09 06:56:27,156 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 06:56:27,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2025-03-09 06:56:27,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-09 06:56:27,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-09 06:56:27,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-09 06:56:27,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:56:27,156 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:56:27,156 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:56:27,157 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:56:27,157 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 06:56:27,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-09 06:56:27,157 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 06:56:27,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-09 06:56:27,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 06:56:27 BoogieIcfgContainer [2025-03-09 06:56:27,163 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 06:56:27,163 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 06:56:27,163 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 06:56:27,163 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 06:56:27,164 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:56:18" (3/4) ... [2025-03-09 06:56:27,165 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 06:56:27,166 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 06:56:27,167 INFO L158 Benchmark]: Toolchain (without parser) took 9276.27ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 109.9MB in the beginning and 93.5MB in the end (delta: 16.5MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. [2025-03-09 06:56:27,167 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:56:27,167 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.88ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 91.7MB in the end (delta: 18.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:56:27,168 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.25ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 90.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:56:27,168 INFO L158 Benchmark]: Boogie Preprocessor took 23.58ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 88.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:56:27,168 INFO L158 Benchmark]: IcfgBuilder took 279.68ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 73.9MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 06:56:27,168 INFO L158 Benchmark]: BuchiAutomizer took 8614.05ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 73.4MB in the beginning and 95.2MB in the end (delta: -21.8MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2025-03-09 06:56:27,168 INFO L158 Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 176.2MB. Free memory was 95.2MB in the beginning and 93.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:56:27,169 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.16ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.88ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 91.7MB in the end (delta: 18.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.25ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 90.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.58ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 88.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 279.68ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 73.9MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 8614.05ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 73.4MB in the beginning and 95.2MB in the end (delta: -21.8MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Witness Printer took 2.81ms. Allocated memory is still 176.2MB. Free memory was 95.2MB in the beginning and 93.5MB in the end (delta: 1.7MB). 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: ~sc1~0!offset - 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 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 3 locations. One deterministic module has affine ranking function null and consists of 3 locations. One nondeterministic module has affine ranking function null and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 7.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 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, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 191 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 123 IncrementalHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 93 mSDtfsCounter, 123 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital269 mio100 ax100 hnf100 lsp110 ukn64 mio100 lsp28 div172 bol100 ite100 ukn100 eq153 hnf95 smp68 dnf1082 smp24 tf100 neg100 sie114 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 251ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 8 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 180 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-09 06:56:27,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2025-03-09 06:56:27,382 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