./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrspn_reverse_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/cstrspn_reverse_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 5874eb83dea617c97f28746e1359ec67eb979d702b31dfbd0eb177fa26bd5d73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:42:54,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:42:55,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-04 15:42:55,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:42:55,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:42:55,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:42:55,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:42:55,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:42:55,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:42:55,047 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:42:55,048 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:42:55,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:42:55,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:42:55,048 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:42:55,048 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:42:55,048 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:42:55,048 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:42:55,048 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:42:55,048 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:42:55,048 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:42:55,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:42:55,049 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:42:55,049 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:42:55,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:42:55,049 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:42:55,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:42:55,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:42:55,049 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:42:55,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:42:55,049 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:42:55,049 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:42:55,049 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:42:55,049 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:42:55,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:42:55,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:42:55,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:42:55,050 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:42:55,050 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 -> 5874eb83dea617c97f28746e1359ec67eb979d702b31dfbd0eb177fa26bd5d73 [2025-03-04 15:42:55,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:42:55,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:42:55,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:42:55,282 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:42:55,282 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:42:55,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrspn_reverse_alloca.i [2025-03-04 15:42:56,463 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/752cf9342/8efc62e140ac4ff5bc18d4099f5b5654/FLAGa058cecde [2025-03-04 15:42:56,676 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:42:56,677 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrspn_reverse_alloca.i [2025-03-04 15:42:56,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/752cf9342/8efc62e140ac4ff5bc18d4099f5b5654/FLAGa058cecde [2025-03-04 15:42:56,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/752cf9342/8efc62e140ac4ff5bc18d4099f5b5654 [2025-03-04 15:42:56,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:42:56,696 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:42:56,696 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:42:56,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:42:56,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:42:56,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:42:56" (1/1) ... [2025-03-04 15:42:56,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b91a4eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:42:56, skipping insertion in model container [2025-03-04 15:42:56,700 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:42:56" (1/1) ... [2025-03-04 15:42:56,721 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:42:56,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:42:56,944 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:42:56,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:42:56,994 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:42:56,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:42:56 WrapperNode [2025-03-04 15:42:56,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:42:56,995 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:42:56,995 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:42:56,996 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:42:56,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:42:56" (1/1) ... [2025-03-04 15:42:57,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:42:56" (1/1) ... [2025-03-04 15:42:57,019 INFO L138 Inliner]: procedures = 152, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2025-03-04 15:42:57,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:42:57,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:42:57,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:42:57,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:42:57,024 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:42:56" (1/1) ... [2025-03-04 15:42:57,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:42:56" (1/1) ... [2025-03-04 15:42:57,026 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:42:56" (1/1) ... [2025-03-04 15:42:57,033 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-04 15:42:57,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:42:56" (1/1) ... [2025-03-04 15:42:57,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:42:56" (1/1) ... [2025-03-04 15:42:57,038 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:42:56" (1/1) ... [2025-03-04 15:42:57,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:42:56" (1/1) ... [2025-03-04 15:42:57,043 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:42:56" (1/1) ... [2025-03-04 15:42:57,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:42:56" (1/1) ... [2025-03-04 15:42:57,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:42:57,045 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:42:57,045 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:42:57,045 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:42:57,051 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:42:56" (1/1) ... [2025-03-04 15:42:57,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:57,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:57,075 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:42:57,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-04 15:42:57,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:42:57,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:42:57,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:42:57,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:42:57,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:42:57,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:42:57,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:42:57,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:42:57,152 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:42:57,153 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:42:57,260 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L394: 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-04 15:42:57,272 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-04 15:42:57,272 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:42:57,279 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:42:57,279 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:42:57,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:42:57 BoogieIcfgContainer [2025-03-04 15:42:57,280 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:42:57,280 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:42:57,281 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:42:57,285 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:42:57,286 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:42:57,286 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:42:56" (1/3) ... [2025-03-04 15:42:57,287 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56ee2009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:42:57, skipping insertion in model container [2025-03-04 15:42:57,288 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:42:57,288 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:42:56" (2/3) ... [2025-03-04 15:42:57,288 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56ee2009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:42:57, skipping insertion in model container [2025-03-04 15:42:57,288 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:42:57,288 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:42:57" (3/3) ... [2025-03-04 15:42:57,289 INFO L363 chiAutomizerObserver]: Analyzing ICFG cstrspn_reverse_alloca.i [2025-03-04 15:42:57,328 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:42:57,328 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:42:57,328 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:42:57,329 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:42:57,329 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:42:57,329 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:42:57,329 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:42:57,329 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:42:57,333 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-04 15:42:57,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:42:57,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:42:57,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:42:57,345 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:42:57,345 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 15:42:57,345 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:42:57,346 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-04 15:42:57,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:42:57,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:42:57,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:42:57,347 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:42:57,347 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 15:42:57,350 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, 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 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_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#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 cstrspn_#res#1;havoc cstrspn_#t~mem205#1, cstrspn_#t~mem206#1, cstrspn_#t~mem207#1, cstrspn_#t~mem208#1, cstrspn_#t~short209#1, cstrspn_#t~post210#1.base, cstrspn_#t~post210#1.offset, cstrspn_#t~mem211#1, cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset;" [2025-03-04 15:42:57,350 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrspn_#t~mem205#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);" "assume 0 != cstrspn_#t~mem205#1;havoc cstrspn_#t~mem205#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem206#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem206#1;havoc cstrspn_#t~mem206#1;" "assume !true;" "call cstrspn_#t~mem211#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);" "assume !(cstrspn_#t~mem211#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem211#1;cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset - 1;havoc cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset;" [2025-03-04 15:42:57,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:57,353 INFO L85 PathProgramCache]: Analyzing trace with hash 59135068, now seen corresponding path program 1 times [2025-03-04 15:42:57,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:42:57,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308613652] [2025-03-04 15:42:57,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:42:57,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:42:57,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:42:57,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:42:57,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:57,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:57,451 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:42:57,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:42:57,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:42:57,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:57,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:57,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:42:57,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:57,495 INFO L85 PathProgramCache]: Analyzing trace with hash 51497458, now seen corresponding path program 1 times [2025-03-04 15:42:57,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:42:57,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434386774] [2025-03-04 15:42:57,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:42:57,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:42:57,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:42:57,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:42:57,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:57,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:42:57,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:42:57,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:42:57,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434386774] [2025-03-04 15:42:57,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434386774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:42:57,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:42:57,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:42:57,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129342813] [2025-03-04 15:42:57,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:42:57,539 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:42:57,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:42:57,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 15:42:57,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 15:42:57,559 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-04 15:42:57,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:42:57,563 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-03-04 15:42:57,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2025-03-04 15:42:57,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:42:57,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 16 transitions. [2025-03-04 15:42:57,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-04 15:42:57,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-03-04 15:42:57,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2025-03-04 15:42:57,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:42:57,572 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-03-04 15:42:57,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2025-03-04 15:42:57,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-04 15:42:57,586 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-04 15:42:57,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2025-03-04 15:42:57,587 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-03-04 15:42:57,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 15:42:57,590 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-03-04 15:42:57,590 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:42:57,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2025-03-04 15:42:57,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:42:57,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:42:57,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:42:57,591 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:42:57,591 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:42:57,591 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, 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 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_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#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 cstrspn_#res#1;havoc cstrspn_#t~mem205#1, cstrspn_#t~mem206#1, cstrspn_#t~mem207#1, cstrspn_#t~mem208#1, cstrspn_#t~short209#1, cstrspn_#t~post210#1.base, cstrspn_#t~post210#1.offset, cstrspn_#t~mem211#1, cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset;" [2025-03-04 15:42:57,591 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrspn_#t~mem205#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);" "assume 0 != cstrspn_#t~mem205#1;havoc cstrspn_#t~mem205#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem206#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem206#1;havoc cstrspn_#t~mem206#1;" "assume true;call cstrspn_#t~mem207#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short209#1 := 0 != cstrspn_#t~mem207#1;" "assume cstrspn_#t~short209#1;call cstrspn_#t~mem208#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short209#1 := cstrspn_#t~mem208#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256);" "assume !cstrspn_#t~short209#1;havoc cstrspn_#t~mem207#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~short209#1;" "call cstrspn_#t~mem211#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);" "assume !(cstrspn_#t~mem211#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem211#1;cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset - 1;havoc cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset;" [2025-03-04 15:42:57,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:57,592 INFO L85 PathProgramCache]: Analyzing trace with hash 59135068, now seen corresponding path program 2 times [2025-03-04 15:42:57,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:42:57,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329802412] [2025-03-04 15:42:57,592 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:42:57,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:42:57,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:42:57,624 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:42:57,624 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:42:57,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:57,624 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:42:57,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:42:57,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:42:57,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:57,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:57,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:42:57,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:57,642 INFO L85 PathProgramCache]: Analyzing trace with hash -2051320785, now seen corresponding path program 1 times [2025-03-04 15:42:57,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:42:57,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428772396] [2025-03-04 15:42:57,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:42:57,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:42:57,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:42:57,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:42:57,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:57,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:57,658 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:42:57,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:42:57,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:42:57,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:57,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:57,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:42:57,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:57,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1866036084, now seen corresponding path program 1 times [2025-03-04 15:42:57,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:42:57,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904744671] [2025-03-04 15:42:57,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:42:57,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:42:57,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:42:57,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:42:57,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:57,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:57,713 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:42:57,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:42:57,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:42:57,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:57,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:57,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:42:58,401 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:42:58,402 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:42:58,402 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:42:58,402 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:42:58,402 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:42:58,402 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:58,402 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:42:58,402 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:42:58,403 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrspn_reverse_alloca.i_Iteration2_Lasso [2025-03-04 15:42:58,403 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:42:58,403 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:42:58,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:58,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:58,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:58,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:58,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:58,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:58,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:58,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:58,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:58,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:58,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:58,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:58,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:58,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:58,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:58,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:58,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:58,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:58,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:58,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:58,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:58,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:58,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:58,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:58,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:58,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:58,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:59,210 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:42:59,213 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:42:59,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:59,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:59,217 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:42:59,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-04 15:42:59,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:42:59,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:59,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:59,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:59,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:59,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:59,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:59,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:59,238 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:59,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-04 15:42:59,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:59,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:59,247 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:42:59,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-04 15:42:59,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:42:59,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:59,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:59,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:59,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:59,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:59,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:59,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:59,266 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:59,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:42:59,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:59,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:59,274 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:42:59,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-04 15:42:59,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-04 15:42:59,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:59,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:59,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:59,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:59,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:59,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:59,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:59,288 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:59,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:42:59,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:59,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:59,296 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:42:59,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-04 15:42:59,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:42:59,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:59,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:59,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:59,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:59,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:59,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:59,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:59,310 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:59,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:42:59,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:59,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:59,317 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:42:59,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-04 15:42:59,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:42:59,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:59,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:59,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:59,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:59,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:59,331 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:59,331 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:59,332 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:59,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:42:59,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:59,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:59,339 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:42:59,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-04 15:42:59,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:42:59,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:59,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:59,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:59,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:59,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:59,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:59,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:59,353 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:59,359 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-04 15:42:59,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:59,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:59,361 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:42:59,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-04 15:42:59,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:42:59,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:59,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:59,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:59,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:59,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:59,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:59,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:59,375 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:59,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-04 15:42:59,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:59,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:59,383 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:42:59,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-04 15:42:59,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:42:59,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:59,397 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:59,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:59,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:59,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:59,399 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:59,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:59,400 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:59,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-04 15:42:59,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:59,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:59,407 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:42:59,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-04 15:42:59,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:42:59,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:59,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:59,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:59,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:59,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:59,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:59,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:59,421 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:59,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-04 15:42:59,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:59,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:59,429 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:42:59,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-04 15:42:59,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:42:59,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:59,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:59,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:59,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:59,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:59,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:59,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:59,443 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:59,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-04 15:42:59,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:59,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:59,451 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:42:59,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-04 15:42:59,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:42:59,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:59,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:59,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:59,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:59,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:42:59,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:42:59,480 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:59,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-04 15:42:59,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:59,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:59,489 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:42:59,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-04 15:42:59,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:42:59,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:59,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:59,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:59,503 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:42:59,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:59,506 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-04 15:42:59,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:59,509 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:59,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-04 15:42:59,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:59,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:59,518 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:42:59,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-04 15:42:59,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:42:59,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:59,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:59,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:59,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:59,535 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:42:59,535 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:42:59,540 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:59,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-04 15:42:59,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:59,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:59,548 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:42:59,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-04 15:42:59,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:42:59,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:59,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:59,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:59,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:59,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:42:59,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:42:59,567 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:59,572 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-04 15:42:59,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:59,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:59,575 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:42:59,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-04 15:42:59,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:42:59,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:59,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:59,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:59,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:59,588 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:42:59,588 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:42:59,590 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:59,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-04 15:42:59,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:59,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:59,598 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:42:59,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-04 15:42:59,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:42:59,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:59,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:59,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:59,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:59,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:42:59,616 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:42:59,618 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:59,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-04 15:42:59,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:59,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:59,629 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:42:59,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-04 15:42:59,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:42:59,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:59,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:59,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:59,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:59,643 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:42:59,644 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:42:59,646 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:59,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-04 15:42:59,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:59,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:59,654 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:42:59,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-04 15:42:59,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:42:59,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:59,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:59,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:59,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:59,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:42:59,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:42:59,682 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:42:59,698 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-04 15:42:59,700 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-03-04 15:42:59,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:59,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:59,705 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:42:59,706 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:42:59,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-04 15:42:59,718 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:42:59,718 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:42:59,718 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0#1.offset) = 2*ULTIMATE.start_cstrspn_~sc1~0#1.offset + 1 Supporting invariants [] [2025-03-04 15:42:59,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-04 15:42:59,745 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-03-04 15:42:59,750 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sc1~0!offset [2025-03-04 15:42:59,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:59,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:42:59,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:42:59,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:59,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:42:59,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:42:59,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:42:59,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:42:59,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:42:59,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:59,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:42:59,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:42:59,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:42:59,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:42:59,844 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-04 15:42:59,845 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-04 15:42:59,878 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-04 15:42:59,879 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-04 15:42:59,880 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-04 15:42:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2025-03-04 15:42:59,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 7 letters. [2025-03-04 15:42:59,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:42:59,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 12 letters. Loop has 7 letters. [2025-03-04 15:42:59,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:42:59,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 14 letters. [2025-03-04 15:42:59,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:42:59,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2025-03-04 15:42:59,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:42:59,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 24 transitions. [2025-03-04 15:42:59,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:42:59,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:42:59,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2025-03-04 15:42:59,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:42:59,887 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 24 transitions. [2025-03-04 15:42:59,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2025-03-04 15:42:59,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-04 15:42:59,888 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-04 15:42:59,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2025-03-04 15:42:59,888 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 24 transitions. [2025-03-04 15:42:59,888 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2025-03-04 15:42:59,888 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:42:59,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2025-03-04 15:42:59,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:42:59,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:42:59,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:42:59,889 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:42:59,889 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:42:59,889 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, 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 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_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#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 cstrspn_#res#1;havoc cstrspn_#t~mem205#1, cstrspn_#t~mem206#1, cstrspn_#t~mem207#1, cstrspn_#t~mem208#1, cstrspn_#t~short209#1, cstrspn_#t~post210#1.base, cstrspn_#t~post210#1.offset, cstrspn_#t~mem211#1, cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset;" "assume true;call cstrspn_#t~mem205#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);" "assume 0 != cstrspn_#t~mem205#1;havoc cstrspn_#t~mem205#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem206#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem206#1;havoc cstrspn_#t~mem206#1;" [2025-03-04 15:42:59,889 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrspn_#t~mem207#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short209#1 := 0 != cstrspn_#t~mem207#1;" "assume cstrspn_#t~short209#1;call cstrspn_#t~mem208#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short209#1 := cstrspn_#t~mem208#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256);" "assume cstrspn_#t~short209#1;havoc cstrspn_#t~mem207#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~short209#1;cstrspn_#t~post210#1.base, cstrspn_#t~post210#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post210#1.base, cstrspn_#t~post210#1.offset - 1;" [2025-03-04 15:42:59,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:59,892 INFO L85 PathProgramCache]: Analyzing trace with hash 994226267, now seen corresponding path program 1 times [2025-03-04 15:42:59,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:42:59,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137005938] [2025-03-04 15:42:59,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:42:59,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:42:59,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:42:59,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:42:59,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:59,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:59,924 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:42:59,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:42:59,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:42:59,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:59,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:59,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:42:59,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:59,952 INFO L85 PathProgramCache]: Analyzing trace with hash 47600, now seen corresponding path program 1 times [2025-03-04 15:42:59,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:42:59,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493053176] [2025-03-04 15:42:59,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:42:59,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:42:59,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:42:59,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:42:59,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:59,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:59,959 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:42:59,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:42:59,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:42:59,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:59,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:59,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:42:59,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:59,967 INFO L85 PathProgramCache]: Analyzing trace with hash 900264790, now seen corresponding path program 1 times [2025-03-04 15:42:59,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:42:59,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085670] [2025-03-04 15:42:59,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:42:59,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:42:59,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:42:59,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:42:59,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:59,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:59,995 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:00,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:43:00,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:43:00,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:00,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:00,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:00,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:00,469 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:43:00,469 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:43:00,469 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:43:00,469 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:43:00,469 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:43:00,469 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:00,469 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:43:00,469 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:43:00,469 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrspn_reverse_alloca.i_Iteration3_Lasso [2025-03-04 15:43:00,469 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:43:00,469 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:43:00,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:00,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:00,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:00,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:00,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:00,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:00,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:00,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:00,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:00,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:00,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:00,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:00,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:00,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:00,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:00,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:00,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:00,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:00,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:00,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:00,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:00,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:00,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:00,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:01,188 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:43:01,188 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:43:01,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:01,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:01,190 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:43:01,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-04 15:43:01,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:01,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:01,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:01,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:01,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:01,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:01,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:01,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:01,204 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:01,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:01,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:01,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:01,211 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:43:01,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-04 15:43:01,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:01,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:01,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:01,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:01,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:01,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:01,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:01,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:01,225 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:01,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-04 15:43:01,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:01,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:01,232 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:43:01,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-04 15:43:01,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:01,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:01,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:01,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:01,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:01,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:01,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:01,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:01,246 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:01,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-04 15:43:01,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:01,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:01,253 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:43:01,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-04 15:43:01,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-04 15:43:01,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:01,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:01,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:01,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:01,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:01,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:01,264 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:01,265 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:01,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-04 15:43:01,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:01,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:01,272 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:43:01,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-04 15:43:01,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:01,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:01,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:01,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:01,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:01,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:01,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:01,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:01,285 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:01,290 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-04 15:43:01,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:01,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:01,292 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:43:01,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-04 15:43:01,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:01,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:01,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:01,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:01,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:01,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:01,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:01,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:01,304 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:01,309 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-04 15:43:01,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:01,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:01,311 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:43:01,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-04 15:43:01,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:01,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:01,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:01,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:01,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:01,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:01,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:01,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:01,323 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:01,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-04 15:43:01,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:01,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:01,331 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-04 15:43:01,332 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-04 15:43:01,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:01,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:01,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:01,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:01,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:01,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:01,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:01,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:01,344 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:01,349 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-04 15:43:01,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:01,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:01,352 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-04 15:43:01,353 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-04 15:43:01,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:01,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:01,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:01,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:01,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:01,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:01,363 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:01,363 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:01,364 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:01,369 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-04 15:43:01,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:01,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:01,371 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-04 15:43:01,372 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-04 15:43:01,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:01,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:01,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:01,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:01,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:01,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:01,383 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:01,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:01,384 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:01,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:01,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:01,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:01,391 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-04 15:43:01,392 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-04 15:43:01,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:01,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:01,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:01,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:01,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:01,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:01,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:01,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:01,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:01,408 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-04 15:43:01,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:01,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:01,410 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-04 15:43:01,411 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-04 15:43:01,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:01,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:01,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:01,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:01,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:01,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:01,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:01,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:01,422 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:01,427 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-04 15:43:01,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:01,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:01,429 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:43:01,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-04 15:43:01,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:01,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:01,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:01,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:01,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:01,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:01,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:01,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:01,441 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:01,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:01,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:01,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:01,449 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-04 15:43:01,451 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-04 15:43:01,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:01,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:01,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:01,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:01,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:01,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:01,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:01,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:01,462 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:01,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:01,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:01,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:01,470 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-04 15:43:01,471 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-04 15:43:01,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:01,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:01,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:01,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:01,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:01,488 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:01,488 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:01,494 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:01,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:01,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:01,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:01,502 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-04 15:43:01,504 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-04 15:43:01,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:01,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:01,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:01,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:01,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:01,519 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:01,519 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:01,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:01,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:01,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:01,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:01,529 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-04 15:43:01,530 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-04 15:43:01,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:01,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:01,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:01,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:01,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:01,546 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:01,546 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:01,553 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:43:01,570 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-04 15:43:01,570 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-04 15:43:01,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:01,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:01,572 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-04 15:43:01,573 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-04 15:43:01,574 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:43:01,586 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:43:01,586 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:43:01,586 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0#1.offset) = 2*ULTIMATE.start_cstrspn_~s~0#1.offset + 1 Supporting invariants [] [2025-03-04 15:43:01,592 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-04 15:43:01,616 INFO L156 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2025-03-04 15:43:01,617 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-04 15:43:01,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:01,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:43:01,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:43:01,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:01,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:01,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:43:01,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:01,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:01,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:01,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:01,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:01,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:43:01,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:01,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:43:01,678 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-04 15:43:01,678 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-04 15:43:01,698 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-04 15:43:01,699 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-04 15:43:01,699 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-04 15:43:01,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2025-03-04 15:43:01,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 3 letters. [2025-03-04 15:43:01,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:01,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 3 letters. [2025-03-04 15:43:01,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:01,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 6 letters. [2025-03-04 15:43:01,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:01,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2025-03-04 15:43:01,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:43:01,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 24 states and 33 transitions. [2025-03-04 15:43:01,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-04 15:43:01,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:43:01,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2025-03-04 15:43:01,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:43:01,701 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 33 transitions. [2025-03-04 15:43:01,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2025-03-04 15:43:01,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-03-04 15:43:01,704 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-04 15:43:01,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2025-03-04 15:43:01,704 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 32 transitions. [2025-03-04 15:43:01,704 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2025-03-04 15:43:01,704 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:43:01,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2025-03-04 15:43:01,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:43:01,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:01,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:01,705 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:43:01,705 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:43:01,705 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, 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 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_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#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 cstrspn_#res#1;havoc cstrspn_#t~mem205#1, cstrspn_#t~mem206#1, cstrspn_#t~mem207#1, cstrspn_#t~mem208#1, cstrspn_#t~short209#1, cstrspn_#t~post210#1.base, cstrspn_#t~post210#1.offset, cstrspn_#t~mem211#1, cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset;" "assume true;call cstrspn_#t~mem205#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);" "assume 0 != cstrspn_#t~mem205#1;havoc cstrspn_#t~mem205#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem206#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem206#1;havoc cstrspn_#t~mem206#1;" "assume true;call cstrspn_#t~mem207#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short209#1 := 0 != cstrspn_#t~mem207#1;" "assume !cstrspn_#t~short209#1;" "assume !cstrspn_#t~short209#1;havoc cstrspn_#t~mem207#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~short209#1;" "call cstrspn_#t~mem211#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);" "assume !(cstrspn_#t~mem211#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem211#1;cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset - 1;havoc cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset;" "assume true;call cstrspn_#t~mem205#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);" "assume 0 != cstrspn_#t~mem205#1;havoc cstrspn_#t~mem205#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem206#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem206#1;havoc cstrspn_#t~mem206#1;" [2025-03-04 15:43:01,705 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrspn_#t~mem207#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short209#1 := 0 != cstrspn_#t~mem207#1;" "assume cstrspn_#t~short209#1;call cstrspn_#t~mem208#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short209#1 := cstrspn_#t~mem208#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256);" "assume cstrspn_#t~short209#1;havoc cstrspn_#t~mem207#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~short209#1;cstrspn_#t~post210#1.base, cstrspn_#t~post210#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post210#1.base, cstrspn_#t~post210#1.offset - 1;" [2025-03-04 15:43:01,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:01,706 INFO L85 PathProgramCache]: Analyzing trace with hash -2007023086, now seen corresponding path program 1 times [2025-03-04 15:43:01,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:01,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372854327] [2025-03-04 15:43:01,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:01,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:01,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:43:01,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:43:01,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:01,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:01,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:43:01,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:43:01,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372854327] [2025-03-04 15:43:01,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372854327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:43:01,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:43:01,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:43:01,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501857509] [2025-03-04 15:43:01,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:43:01,811 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:43:01,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:01,812 INFO L85 PathProgramCache]: Analyzing trace with hash 47600, now seen corresponding path program 2 times [2025-03-04 15:43:01,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:01,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039062390] [2025-03-04 15:43:01,812 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:43:01,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:01,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:01,816 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:01,816 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:43:01,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:01,816 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:01,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:01,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:01,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:01,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:01,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:01,888 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-04 15:43:01,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:43:01,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:43:01,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:43:01,924 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:43:01,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:43:01,967 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2025-03-04 15:43:01,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2025-03-04 15:43:01,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-04 15:43:01,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 34 transitions. [2025-03-04 15:43:01,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-04 15:43:01,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-04 15:43:01,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2025-03-04 15:43:01,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:43:01,968 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 34 transitions. [2025-03-04 15:43:01,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2025-03-04 15:43:01,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2025-03-04 15:43:01,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 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-04 15:43:01,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2025-03-04 15:43:01,969 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 32 transitions. [2025-03-04 15:43:01,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:43:01,970 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2025-03-04 15:43:01,970 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:43:01,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2025-03-04 15:43:01,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:43:01,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:01,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:01,971 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:43:01,971 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:43:01,971 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, 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 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_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#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 cstrspn_#res#1;havoc cstrspn_#t~mem205#1, cstrspn_#t~mem206#1, cstrspn_#t~mem207#1, cstrspn_#t~mem208#1, cstrspn_#t~short209#1, cstrspn_#t~post210#1.base, cstrspn_#t~post210#1.offset, cstrspn_#t~mem211#1, cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset;" "assume true;call cstrspn_#t~mem205#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);" "assume 0 != cstrspn_#t~mem205#1;havoc cstrspn_#t~mem205#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem206#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem206#1;havoc cstrspn_#t~mem206#1;" "assume true;call cstrspn_#t~mem207#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short209#1 := 0 != cstrspn_#t~mem207#1;" "assume cstrspn_#t~short209#1;call cstrspn_#t~mem208#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short209#1 := cstrspn_#t~mem208#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256);" "assume !cstrspn_#t~short209#1;havoc cstrspn_#t~mem207#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~short209#1;" "call cstrspn_#t~mem211#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);" "assume !(cstrspn_#t~mem211#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem211#1;cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset - 1;havoc cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset;" "assume true;call cstrspn_#t~mem205#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);" "assume 0 != cstrspn_#t~mem205#1;havoc cstrspn_#t~mem205#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem206#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem206#1;havoc cstrspn_#t~mem206#1;" [2025-03-04 15:43:01,971 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrspn_#t~mem207#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short209#1 := 0 != cstrspn_#t~mem207#1;" "assume cstrspn_#t~short209#1;call cstrspn_#t~mem208#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short209#1 := cstrspn_#t~mem208#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256);" "assume cstrspn_#t~short209#1;havoc cstrspn_#t~mem207#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~short209#1;cstrspn_#t~post210#1.base, cstrspn_#t~post210#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post210#1.base, cstrspn_#t~post210#1.offset - 1;" [2025-03-04 15:43:01,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:01,972 INFO L85 PathProgramCache]: Analyzing trace with hash -2035652237, now seen corresponding path program 2 times [2025-03-04 15:43:01,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:01,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931406440] [2025-03-04 15:43:01,972 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:43:01,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:01,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 15:43:01,985 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:43:01,985 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:43:01,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:01,985 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:01,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:43:01,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:43:01,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:01,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:01,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:01,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:01,995 INFO L85 PathProgramCache]: Analyzing trace with hash 47600, now seen corresponding path program 3 times [2025-03-04 15:43:01,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:01,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433217182] [2025-03-04 15:43:01,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:43:01,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:01,998 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:01,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:02,000 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:43:02,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:02,000 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:02,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:02,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:02,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:02,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:02,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:02,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:02,003 INFO L85 PathProgramCache]: Analyzing trace with hash 822444862, now seen corresponding path program 1 times [2025-03-04 15:43:02,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:02,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470919315] [2025-03-04 15:43:02,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:02,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:02,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:43:02,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:43:02,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:02,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:02,016 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:02,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:43:02,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:43:02,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:02,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:02,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:02,823 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:43:02,823 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:43:02,823 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:43:02,823 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:43:02,823 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:43:02,823 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:02,823 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:43:02,823 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:43:02,823 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrspn_reverse_alloca.i_Iteration5_Lasso [2025-03-04 15:43:02,823 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:43:02,823 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:43:02,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:02,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:02,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:02,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:03,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:03,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:03,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:03,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:03,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:03,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:03,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:03,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:03,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:03,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:03,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:03,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:03,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:03,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:03,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:03,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:03,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:03,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:03,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:03,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:03,789 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:43:03,789 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:43:03,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:03,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:03,791 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-04 15:43:03,791 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-04 15:43:03,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:03,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:03,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:03,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:03,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:03,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:03,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:03,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:03,803 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:03,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-03-04 15:43:03,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:03,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:03,810 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-04 15:43:03,811 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-04 15:43:03,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:03,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:03,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:03,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:03,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:03,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:03,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:03,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:03,822 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:03,827 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-04 15:43:03,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:03,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:03,829 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-04 15:43:03,830 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-04 15:43:03,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:03,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:03,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:03,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:03,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:03,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:03,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:03,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:03,841 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:03,846 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-04 15:43:03,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:03,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:03,848 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-04 15:43:03,849 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-04 15:43:03,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:03,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:03,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:03,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:03,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:03,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:03,863 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:03,870 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:03,875 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-04 15:43:03,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:03,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:03,877 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-04 15:43:03,879 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-04 15:43:03,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:03,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:03,890 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2025-03-04 15:43:03,890 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2025-03-04 15:43:03,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:03,948 INFO L401 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2025-03-04 15:43:03,948 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2025-03-04 15:43:04,056 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:04,063 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-04 15:43:04,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:04,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:04,065 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-04 15:43:04,066 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-04 15:43:04,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:04,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:04,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:04,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:04,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:04,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:04,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:04,082 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:04,087 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-04 15:43:04,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:04,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:04,089 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-04 15:43:04,090 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-04 15:43:04,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:04,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:04,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:04,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:04,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:04,102 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:04,102 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:04,106 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:04,111 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-04 15:43:04,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:04,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:04,113 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-04 15:43:04,115 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-04 15:43:04,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:04,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:04,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:04,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:04,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:04,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:04,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:04,128 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:04,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:04,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:04,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:04,136 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:43:04,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-04 15:43:04,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:04,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:04,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:04,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:04,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:04,149 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:04,149 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:04,151 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:04,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:04,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:04,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:04,158 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:43:04,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-04 15:43:04,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:04,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:04,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:04,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:04,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:04,172 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:04,172 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:04,179 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:43:04,199 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-03-04 15:43:04,199 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-03-04 15:43:04,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:04,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:04,201 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:43:04,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-04 15:43:04,202 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:43:04,212 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:43:04,212 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:43:04,212 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0#1.offset) = 2*ULTIMATE.start_cstrspn_~s~0#1.offset + 1 Supporting invariants [] [2025-03-04 15:43:04,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-03-04 15:43:04,252 INFO L156 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2025-03-04 15:43:04,253 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-04 15:43:04,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:04,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:43:04,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:04,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:43:04,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:04,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:04,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:43:04,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:04,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:04,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:04,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:04,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:04,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:43:04,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:04,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:43:04,329 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-04 15:43:04,329 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-04 15:43:04,351 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 30 states and 39 transitions. Complement of second has 5 states. [2025-03-04 15:43:04,352 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-04 15:43:04,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-04 15:43:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2025-03-04 15:43:04,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-04 15:43:04,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:04,353 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:43:04,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:04,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:43:04,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:43:04,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:04,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:04,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:43:04,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:04,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:04,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:04,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:04,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:04,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:43:04,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:04,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:43:04,410 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:43:04,410 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-04 15:43:04,424 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 30 states and 39 transitions. Complement of second has 5 states. [2025-03-04 15:43:04,425 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-04 15:43:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-04 15:43:04,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2025-03-04 15:43:04,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-04 15:43:04,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:04,426 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:43:04,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:04,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:43:04,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:43:04,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:04,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:04,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:43:04,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:04,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:04,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:04,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:04,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:04,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:43:04,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:04,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:43:04,495 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:43:04,495 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-04 15:43:04,514 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 47 transitions. Complement of second has 4 states. [2025-03-04 15:43:04,515 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-04 15:43:04,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-04 15:43:04,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2025-03-04 15:43:04,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-04 15:43:04,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:04,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 17 letters. Loop has 3 letters. [2025-03-04 15:43:04,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:04,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 14 letters. Loop has 6 letters. [2025-03-04 15:43:04,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:04,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 47 transitions. [2025-03-04 15:43:04,519 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:43:04,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2025-03-04 15:43:04,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:43:04,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:43:04,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:43:04,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:43:04,519 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:43:04,519 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:43:04,519 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:43:04,519 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:43:04,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 15:43:04,519 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:43:04,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 15:43:04,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:43:04 BoogieIcfgContainer [2025-03-04 15:43:04,530 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:43:04,530 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:43:04,530 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:43:04,530 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:43:04,531 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:42:57" (3/4) ... [2025-03-04 15:43:04,532 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 15:43:04,533 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:43:04,533 INFO L158 Benchmark]: Toolchain (without parser) took 7837.68ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 112.5MB in the beginning and 114.7MB in the end (delta: -2.2MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2025-03-04 15:43:04,533 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:43:04,534 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.55ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 93.9MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:43:04,534 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.76ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:43:04,534 INFO L158 Benchmark]: Boogie Preprocessor took 25.33ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:43:04,534 INFO L158 Benchmark]: IcfgBuilder took 234.36ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 76.1MB in the end (delta: 14.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:43:04,534 INFO L158 Benchmark]: BuchiAutomizer took 7249.11ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 76.1MB in the beginning and 114.7MB in the end (delta: -38.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:43:04,534 INFO L158 Benchmark]: Witness Printer took 2.78ms. Allocated memory is still 176.2MB. Free memory was 114.7MB in the beginning and 114.7MB in the end (delta: 33.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:43:04,536 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.91ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.55ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 93.9MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.76ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.33ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 234.36ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 76.1MB in the end (delta: 14.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 7249.11ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 76.1MB in the beginning and 114.7MB in the end (delta: -38.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.78ms. Allocated memory is still 176.2MB. Free memory was 114.7MB in the beginning and 114.7MB in the end (delta: 33.1kB). Peak memory consumption was 8.4MB. 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: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 6.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 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, 90 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 85 mSDsluCounter, 147 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 69 IncrementalHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 99 mSDtfsCounter, 69 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital247 mio100 ax100 hnf100 lsp112 ukn71 mio100 lsp26 div189 bol100 ite100 ukn100 eq159 hnf94 smp67 dnf715 smp25 tf100 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 180ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-04 15:43:04,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE