./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrpbrk_mixed_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/cstrpbrk_mixed_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 76cdad16cb8577e2fa2738f5c22f29ef30a5ca1ee31bc621195c1ea9243fa2ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:42:47,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:42:47,172 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:47,177 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:42:47,179 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:42:47,179 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:42:47,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:42:47,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:42:47,194 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:42:47,194 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:42:47,194 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:42:47,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:42:47,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:42:47,194 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:42:47,194 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:42:47,194 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:42:47,194 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:42:47,194 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:42:47,194 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:42:47,194 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:42:47,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:42:47,195 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:42:47,195 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:42:47,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:42:47,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:42:47,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:42:47,195 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:42:47,195 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:42:47,195 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:42:47,195 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:42:47,195 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:42:47,196 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:42:47,196 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:42:47,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:42:47,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:42:47,196 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:42:47,196 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:42:47,196 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 -> 76cdad16cb8577e2fa2738f5c22f29ef30a5ca1ee31bc621195c1ea9243fa2ae [2025-03-04 15:42:47,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:42:47,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:42:47,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:42:47,427 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:42:47,428 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:42:47,429 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrpbrk_mixed_alloca.i [2025-03-04 15:42:48,511 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e1bc41ba/4df6285ff2564a9e9c560f96775ca0af/FLAG4b0eefb4f [2025-03-04 15:42:48,775 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:42:48,776 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrpbrk_mixed_alloca.i [2025-03-04 15:42:48,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e1bc41ba/4df6285ff2564a9e9c560f96775ca0af/FLAG4b0eefb4f [2025-03-04 15:42:48,799 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e1bc41ba/4df6285ff2564a9e9c560f96775ca0af [2025-03-04 15:42:48,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:42:48,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:42:48,805 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:42:48,806 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:42:48,809 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:42:48,810 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:42:48" (1/1) ... [2025-03-04 15:42:48,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46b07572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:42:48, skipping insertion in model container [2025-03-04 15:42:48,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:42:48" (1/1) ... [2025-03-04 15:42:48,836 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:42:49,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:42:49,070 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:42:49,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:42:49,122 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:42:49,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:42:49 WrapperNode [2025-03-04 15:42:49,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:42:49,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:42:49,123 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:42:49,123 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:42:49,127 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:49" (1/1) ... [2025-03-04 15:42:49,136 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:49" (1/1) ... [2025-03-04 15:42:49,152 INFO L138 Inliner]: procedures = 152, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2025-03-04 15:42:49,153 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:42:49,153 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:42:49,154 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:42:49,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:42:49,158 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:49" (1/1) ... [2025-03-04 15:42:49,158 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:49" (1/1) ... [2025-03-04 15:42:49,160 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:49" (1/1) ... [2025-03-04 15:42:49,167 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:49,168 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:49" (1/1) ... [2025-03-04 15:42:49,168 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:49" (1/1) ... [2025-03-04 15:42:49,171 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:49" (1/1) ... [2025-03-04 15:42:49,173 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:49" (1/1) ... [2025-03-04 15:42:49,174 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:49" (1/1) ... [2025-03-04 15:42:49,175 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:49" (1/1) ... [2025-03-04 15:42:49,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:42:49,178 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:42:49,179 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:42:49,179 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:42:49,179 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:42:49" (1/1) ... [2025-03-04 15:42:49,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:49,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:49,201 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:49,203 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:49,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:42:49,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:42:49,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:42:49,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:42:49,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:42:49,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:42:49,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:42:49,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:42:49,279 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:42:49,281 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:42:49,394 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L388: 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:49,407 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-04 15:42:49,407 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:42:49,414 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:42:49,416 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:42:49,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:42:49 BoogieIcfgContainer [2025-03-04 15:42:49,416 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:42:49,417 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:42:49,417 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:42:49,421 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:42:49,422 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:42:49,422 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:42:48" (1/3) ... [2025-03-04 15:42:49,422 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45bc6b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:42:49, skipping insertion in model container [2025-03-04 15:42:49,422 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:42:49,422 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:42:49" (2/3) ... [2025-03-04 15:42:49,423 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45bc6b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:42:49, skipping insertion in model container [2025-03-04 15:42:49,423 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:42:49,423 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:42:49" (3/3) ... [2025-03-04 15:42:49,424 INFO L363 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_mixed_alloca.i [2025-03-04 15:42:49,451 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:42:49,451 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:42:49,451 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:42:49,451 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:42:49,451 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:42:49,451 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:42:49,452 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:42:49,452 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:42:49,455 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:49,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:42:49,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:42:49,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:42:49,467 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:42:49,467 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 15:42:49,467 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:42:49,468 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:49,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:42:49,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:42:49,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:42:49,469 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:42:49,469 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 15:42:49,472 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.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#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 cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem205#1, cstrpbrk_#t~mem206#1, cstrpbrk_#t~mem207#1, cstrpbrk_#t~mem208#1, cstrpbrk_#t~short209#1, cstrpbrk_#t~post210#1.base, cstrpbrk_#t~post210#1.offset, cstrpbrk_#t~mem211#1, cstrpbrk_#t~post212#1.base, cstrpbrk_#t~post212#1.offset, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;" [2025-03-04 15:42:49,472 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrpbrk_#t~mem205#1 := read~int#0(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);" "assume 0 != cstrpbrk_#t~mem205#1;havoc cstrpbrk_#t~mem205#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem206#1 := read~int#0(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem206#1;havoc cstrpbrk_#t~mem206#1;" "assume !true;" "call cstrpbrk_#t~mem211#1 := read~int#1(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);" "assume !(cstrpbrk_#t~mem211#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem211#1;cstrpbrk_#t~post212#1.base, cstrpbrk_#t~post212#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post212#1.base, 1 + cstrpbrk_#t~post212#1.offset;havoc cstrpbrk_#t~post212#1.base, cstrpbrk_#t~post212#1.offset;" [2025-03-04 15:42:49,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:49,476 INFO L85 PathProgramCache]: Analyzing trace with hash 59135068, now seen corresponding path program 1 times [2025-03-04 15:42:49,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:42:49,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704869239] [2025-03-04 15:42:49,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:42:49,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:42:49,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:42:49,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:42:49,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:49,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:49,588 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:42:49,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:42:49,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:42:49,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:49,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:49,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:42:49,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:49,633 INFO L85 PathProgramCache]: Analyzing trace with hash 51497458, now seen corresponding path program 1 times [2025-03-04 15:42:49,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:42:49,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397572251] [2025-03-04 15:42:49,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:42:49,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:42:49,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:42:49,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:42:49,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:49,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:42:49,676 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:49,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:42:49,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397572251] [2025-03-04 15:42:49,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397572251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:42:49,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:42:49,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:42:49,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411159618] [2025-03-04 15:42:49,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:42:49,682 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:42:49,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:42:49,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 15:42:49,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 15:42:49,705 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:49,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:42:49,710 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-03-04 15:42:49,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2025-03-04 15:42:49,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:42:49,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 16 transitions. [2025-03-04 15:42:49,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-04 15:42:49,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-03-04 15:42:49,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2025-03-04 15:42:49,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:42:49,720 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-03-04 15:42:49,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2025-03-04 15:42:49,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-04 15:42:49,737 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:49,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2025-03-04 15:42:49,738 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-03-04 15:42:49,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 15:42:49,742 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-03-04 15:42:49,742 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:42:49,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2025-03-04 15:42:49,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:42:49,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:42:49,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:42:49,743 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:42:49,744 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:42:49,744 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.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#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 cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem205#1, cstrpbrk_#t~mem206#1, cstrpbrk_#t~mem207#1, cstrpbrk_#t~mem208#1, cstrpbrk_#t~short209#1, cstrpbrk_#t~post210#1.base, cstrpbrk_#t~post210#1.offset, cstrpbrk_#t~mem211#1, cstrpbrk_#t~post212#1.base, cstrpbrk_#t~post212#1.offset, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;" [2025-03-04 15:42:49,744 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrpbrk_#t~mem205#1 := read~int#0(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);" "assume 0 != cstrpbrk_#t~mem205#1;havoc cstrpbrk_#t~mem205#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem206#1 := read~int#0(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem206#1;havoc cstrpbrk_#t~mem206#1;" "assume true;call cstrpbrk_#t~mem207#1 := read~int#1(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short209#1 := 0 != cstrpbrk_#t~mem207#1;" "assume cstrpbrk_#t~short209#1;call cstrpbrk_#t~mem208#1 := read~int#1(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short209#1 := cstrpbrk_#t~mem208#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256);" "assume !cstrpbrk_#t~short209#1;havoc cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~short209#1;" "call cstrpbrk_#t~mem211#1 := read~int#1(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);" "assume !(cstrpbrk_#t~mem211#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem211#1;cstrpbrk_#t~post212#1.base, cstrpbrk_#t~post212#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post212#1.base, 1 + cstrpbrk_#t~post212#1.offset;havoc cstrpbrk_#t~post212#1.base, cstrpbrk_#t~post212#1.offset;" [2025-03-04 15:42:49,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:49,744 INFO L85 PathProgramCache]: Analyzing trace with hash 59135068, now seen corresponding path program 2 times [2025-03-04 15:42:49,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:42:49,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964104188] [2025-03-04 15:42:49,745 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:42:49,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:42:49,758 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:42:49,772 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:49,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:42:49,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:49,772 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:42:49,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:42:49,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:49,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:49,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:49,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:42:49,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:49,787 INFO L85 PathProgramCache]: Analyzing trace with hash -2051320785, now seen corresponding path program 1 times [2025-03-04 15:42:49,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:42:49,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036604603] [2025-03-04 15:42:49,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:42:49,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:42:49,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:42:49,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:49,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:49,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:49,808 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:42:49,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:42:49,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:42:49,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:49,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:49,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:42:49,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:49,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1866036084, now seen corresponding path program 1 times [2025-03-04 15:42:49,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:42:49,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626530937] [2025-03-04 15:42:49,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:42:49,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:42:49,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:42:49,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:42:49,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:49,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:49,847 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:42:49,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:42:49,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:42:49,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:49,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:49,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:42:50,692 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:42:50,692 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:42:50,693 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:42:50,693 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:42:50,693 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:42:50,693 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:50,693 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:42:50,693 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:42:50,694 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_mixed_alloca.i_Iteration2_Lasso [2025-03-04 15:42:50,694 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:42:50,694 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:42:50,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:50,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:50,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:50,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:50,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:50,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:50,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:50,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:50,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:50,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:51,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:51,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:51,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:51,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:51,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:51,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:51,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:51,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:51,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:51,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:51,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:51,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:51,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:51,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:51,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:51,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:51,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:51,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:51,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:51,417 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:42:51,420 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:42:51,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:51,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:51,423 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:51,427 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:51,428 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:51,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:51,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:51,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:51,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:51,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:51,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:51,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:51,445 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:51,455 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:51,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:51,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:51,459 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:51,460 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:51,460 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:51,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:51,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:51,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:51,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:51,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:51,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:51,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:51,473 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:51,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-04 15:42:51,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:51,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:51,481 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:51,483 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:51,484 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:51,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:51,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:51,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:51,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:51,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:51,496 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:51,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:51,497 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:51,503 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:51,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:51,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:51,507 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:51,507 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:51,509 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:51,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:51,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:51,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:51,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:51,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:51,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:51,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:51,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:51,527 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:51,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:51,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:51,530 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:51,531 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:51,533 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:51,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:51,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:51,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:51,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:51,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:51,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:51,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:51,546 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:51,552 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:51,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:51,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:51,554 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:51,556 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:51,557 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:51,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:51,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:51,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:51,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:51,578 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:42:51,578 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:42:51,583 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:51,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:42:51,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:51,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:51,593 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:51,594 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:51,594 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:51,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:51,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:51,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:51,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:51,613 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:42:51,613 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:42:51,620 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:42:51,644 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-04 15:42:51,646 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-04 15:42:51,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:51,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:51,650 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:51,652 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:51,653 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:42:51,666 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:42:51,667 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:42:51,667 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc215#1.base)_1, ULTIMATE.start_cstrpbrk_~sc1~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215#1.base)_1 - 1*ULTIMATE.start_cstrpbrk_~sc1~0#1.offset Supporting invariants [] [2025-03-04 15:42:51,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-04 15:42:51,701 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2025-03-04 15:42:51,706 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 15:42:51,707 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 15:42:51,708 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sc1~0!offset [2025-03-04 15:42:51,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:51,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:42:51,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:42:51,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:51,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:42:51,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:42:51,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:42:51,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:42:51,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:42:51,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:51,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:42:51,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:42:51,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:42:51,823 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:51,826 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:51,827 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:51,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:51,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:51,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:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2025-03-04 15:42:51,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:51,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:42:51,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 12 letters. Loop has 7 letters. [2025-03-04 15:42:51,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:42:51,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 14 letters. [2025-03-04 15:42:51,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:42:51,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2025-03-04 15:42:51,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:42:51,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 24 transitions. [2025-03-04 15:42:51,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:42:51,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:42:51,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2025-03-04 15:42:51,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:42:51,887 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 24 transitions. [2025-03-04 15:42:51,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2025-03-04 15:42:51,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-04 15:42:51,889 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:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2025-03-04 15:42:51,889 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 24 transitions. [2025-03-04 15:42:51,889 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2025-03-04 15:42:51,889 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:42:51,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2025-03-04 15:42:51,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:42:51,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:42:51,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:42:51,891 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:42:51,891 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:42:51,891 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.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#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 cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem205#1, cstrpbrk_#t~mem206#1, cstrpbrk_#t~mem207#1, cstrpbrk_#t~mem208#1, cstrpbrk_#t~short209#1, cstrpbrk_#t~post210#1.base, cstrpbrk_#t~post210#1.offset, cstrpbrk_#t~mem211#1, cstrpbrk_#t~post212#1.base, cstrpbrk_#t~post212#1.offset, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;" "assume true;call cstrpbrk_#t~mem205#1 := read~int#0(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);" "assume 0 != cstrpbrk_#t~mem205#1;havoc cstrpbrk_#t~mem205#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem206#1 := read~int#0(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem206#1;havoc cstrpbrk_#t~mem206#1;" [2025-03-04 15:42:51,891 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrpbrk_#t~mem207#1 := read~int#1(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short209#1 := 0 != cstrpbrk_#t~mem207#1;" "assume cstrpbrk_#t~short209#1;call cstrpbrk_#t~mem208#1 := read~int#1(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short209#1 := cstrpbrk_#t~mem208#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256);" "assume cstrpbrk_#t~short209#1;havoc cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~short209#1;cstrpbrk_#t~post210#1.base, cstrpbrk_#t~post210#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post210#1.base, cstrpbrk_#t~post210#1.offset - 1;" [2025-03-04 15:42:51,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:51,892 INFO L85 PathProgramCache]: Analyzing trace with hash 994226267, now seen corresponding path program 1 times [2025-03-04 15:42:51,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:42:51,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797132353] [2025-03-04 15:42:51,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:42:51,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:42:51,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:42:51,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:42:51,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:51,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:51,910 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:42:51,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:42:51,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:42:51,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:51,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:51,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:42:51,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:51,933 INFO L85 PathProgramCache]: Analyzing trace with hash 47600, now seen corresponding path program 1 times [2025-03-04 15:42:51,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:42:51,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513241136] [2025-03-04 15:42:51,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:42:51,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:42:51,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:42:51,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:42:51,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:51,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:51,947 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:42:51,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:42:51,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:42:51,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:51,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:51,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:42:51,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:51,954 INFO L85 PathProgramCache]: Analyzing trace with hash 900264790, now seen corresponding path program 1 times [2025-03-04 15:42:51,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:42:51,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64092446] [2025-03-04 15:42:51,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:42:51,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:42:51,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:42:51,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:42:51,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:51,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:51,978 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:42:51,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:42:52,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:42:52,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:52,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:52,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:42:52,214 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:52,566 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:42:52,567 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:42:52,567 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:42:52,567 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:42:52,567 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:42:52,567 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:52,567 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:42:52,567 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:42:52,567 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_mixed_alloca.i_Iteration3_Lasso [2025-03-04 15:42:52,567 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:42:52,567 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:42:52,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:52,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:52,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:52,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:52,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:52,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:52,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:52,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:52,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:52,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:52,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:52,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:52,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:52,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:52,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:52,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:52,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:52,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:52,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:52,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:52,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:52,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:52,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:52,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:52,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:52,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:52,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:53,210 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:42:53,210 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:42:53,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:53,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:53,215 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:53,217 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:53,218 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:53,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:53,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:53,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:53,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:53,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:53,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:53,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:53,230 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:53,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-04 15:42:53,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:53,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:53,238 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:53,239 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:53,240 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:53,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:53,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:53,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:53,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:53,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:53,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:53,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:53,252 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:53,258 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:53,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:53,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:53,259 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:53,264 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:53,264 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:53,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:53,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:53,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:53,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:53,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:53,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:53,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:53,275 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:53,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-04 15:42:53,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:53,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:53,282 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:53,282 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:53,283 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:53,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:53,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:53,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:53,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:53,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:53,293 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:53,293 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:53,294 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:53,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-04 15:42:53,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:53,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:53,300 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:53,301 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:53,301 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:53,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:53,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:53,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:53,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:53,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:53,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:53,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:53,312 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:53,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-04 15:42:53,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:53,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:53,345 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:53,345 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:53,347 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:53,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:53,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:53,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:53,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:53,358 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:42:53,358 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:42:53,360 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:53,365 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:53,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:53,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:53,367 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:53,368 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:53,369 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:53,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:53,380 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-04 15:42:53,380 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2025-03-04 15:42:53,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:53,421 INFO L401 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2025-03-04 15:42:53,421 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2025-03-04 15:42:53,489 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:53,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-04 15:42:53,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:53,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:53,499 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:53,500 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:53,501 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:53,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:53,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:53,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:53,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:53,516 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:42:53,516 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:42:53,524 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:42:53,540 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-04 15:42:53,540 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-04 15:42:53,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:53,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:53,542 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:53,543 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:42:53,543 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:53,553 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:42:53,554 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:42:53,554 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0#1.offset) = 2*ULTIMATE.start_cstrpbrk_~s~0#1.offset + 1 Supporting invariants [] [2025-03-04 15:42:53,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-04 15:42:53,573 INFO L156 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2025-03-04 15:42:53,573 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-04 15:42:53,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:53,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:42:53,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:42:53,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:53,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:42:53,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:42:53,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:42:53,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:42:53,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:42:53,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:53,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:42:53,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:42:53,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:42:53,626 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:53,626 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:53,626 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:42:53,641 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:42:53,644 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:53,644 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:42:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2025-03-04 15:42:53,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 3 letters. [2025-03-04 15:42:53,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:42:53,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 3 letters. [2025-03-04 15:42:53,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:42:53,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 6 letters. [2025-03-04 15:42:53,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:42:53,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2025-03-04 15:42:53,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:42:53,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 24 states and 33 transitions. [2025-03-04 15:42:53,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-04 15:42:53,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:42:53,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2025-03-04 15:42:53,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:42:53,646 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 33 transitions. [2025-03-04 15:42:53,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2025-03-04 15:42:53,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-03-04 15:42:53,647 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:42:53,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2025-03-04 15:42:53,647 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 32 transitions. [2025-03-04 15:42:53,647 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2025-03-04 15:42:53,647 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:42:53,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2025-03-04 15:42:53,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:42:53,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:42:53,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:42:53,649 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:42:53,649 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:42:53,649 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.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#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 cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem205#1, cstrpbrk_#t~mem206#1, cstrpbrk_#t~mem207#1, cstrpbrk_#t~mem208#1, cstrpbrk_#t~short209#1, cstrpbrk_#t~post210#1.base, cstrpbrk_#t~post210#1.offset, cstrpbrk_#t~mem211#1, cstrpbrk_#t~post212#1.base, cstrpbrk_#t~post212#1.offset, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;" "assume true;call cstrpbrk_#t~mem205#1 := read~int#0(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);" "assume 0 != cstrpbrk_#t~mem205#1;havoc cstrpbrk_#t~mem205#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem206#1 := read~int#0(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem206#1;havoc cstrpbrk_#t~mem206#1;" "assume true;call cstrpbrk_#t~mem207#1 := read~int#1(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short209#1 := 0 != cstrpbrk_#t~mem207#1;" "assume !cstrpbrk_#t~short209#1;" "assume !cstrpbrk_#t~short209#1;havoc cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~short209#1;" "call cstrpbrk_#t~mem211#1 := read~int#1(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);" "assume !(cstrpbrk_#t~mem211#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem211#1;cstrpbrk_#t~post212#1.base, cstrpbrk_#t~post212#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post212#1.base, 1 + cstrpbrk_#t~post212#1.offset;havoc cstrpbrk_#t~post212#1.base, cstrpbrk_#t~post212#1.offset;" "assume true;call cstrpbrk_#t~mem205#1 := read~int#0(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);" "assume 0 != cstrpbrk_#t~mem205#1;havoc cstrpbrk_#t~mem205#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem206#1 := read~int#0(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem206#1;havoc cstrpbrk_#t~mem206#1;" [2025-03-04 15:42:53,650 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrpbrk_#t~mem207#1 := read~int#1(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short209#1 := 0 != cstrpbrk_#t~mem207#1;" "assume cstrpbrk_#t~short209#1;call cstrpbrk_#t~mem208#1 := read~int#1(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short209#1 := cstrpbrk_#t~mem208#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256);" "assume cstrpbrk_#t~short209#1;havoc cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~short209#1;cstrpbrk_#t~post210#1.base, cstrpbrk_#t~post210#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post210#1.base, cstrpbrk_#t~post210#1.offset - 1;" [2025-03-04 15:42:53,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:53,650 INFO L85 PathProgramCache]: Analyzing trace with hash -2007023086, now seen corresponding path program 1 times [2025-03-04 15:42:53,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:42:53,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116298231] [2025-03-04 15:42:53,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:42:53,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:42:53,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:42:53,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:42:53,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:53,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:42:53,785 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:42:53,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:42:53,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116298231] [2025-03-04 15:42:53,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116298231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:42:53,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:42:53,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:42:53,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429963816] [2025-03-04 15:42:53,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:42:53,786 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:42:53,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:53,787 INFO L85 PathProgramCache]: Analyzing trace with hash 47600, now seen corresponding path program 2 times [2025-03-04 15:42:53,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:42:53,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465125985] [2025-03-04 15:42:53,787 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:42:53,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:42:53,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:42:53,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:42:53,791 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:42:53,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:53,791 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:42:53,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:42:53,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:42:53,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:53,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:53,795 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:42:53,864 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:53,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:42:53,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:42:53,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:42:53,890 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:42:53,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:42:53,934 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2025-03-04 15:42:53,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2025-03-04 15:42:53,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-04 15:42:53,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 34 transitions. [2025-03-04 15:42:53,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-04 15:42:53,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-04 15:42:53,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2025-03-04 15:42:53,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:42:53,936 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 34 transitions. [2025-03-04 15:42:53,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2025-03-04 15:42:53,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2025-03-04 15:42:53,937 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:42:53,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2025-03-04 15:42:53,937 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 32 transitions. [2025-03-04 15:42:53,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:42:53,938 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2025-03-04 15:42:53,938 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:42:53,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2025-03-04 15:42:53,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:42:53,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:42:53,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:42:53,940 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:42:53,940 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:42:53,941 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.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#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 cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem205#1, cstrpbrk_#t~mem206#1, cstrpbrk_#t~mem207#1, cstrpbrk_#t~mem208#1, cstrpbrk_#t~short209#1, cstrpbrk_#t~post210#1.base, cstrpbrk_#t~post210#1.offset, cstrpbrk_#t~mem211#1, cstrpbrk_#t~post212#1.base, cstrpbrk_#t~post212#1.offset, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;" "assume true;call cstrpbrk_#t~mem205#1 := read~int#0(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);" "assume 0 != cstrpbrk_#t~mem205#1;havoc cstrpbrk_#t~mem205#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem206#1 := read~int#0(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem206#1;havoc cstrpbrk_#t~mem206#1;" "assume true;call cstrpbrk_#t~mem207#1 := read~int#1(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short209#1 := 0 != cstrpbrk_#t~mem207#1;" "assume cstrpbrk_#t~short209#1;call cstrpbrk_#t~mem208#1 := read~int#1(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short209#1 := cstrpbrk_#t~mem208#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256);" "assume !cstrpbrk_#t~short209#1;havoc cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~short209#1;" "call cstrpbrk_#t~mem211#1 := read~int#1(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);" "assume !(cstrpbrk_#t~mem211#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem211#1;cstrpbrk_#t~post212#1.base, cstrpbrk_#t~post212#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post212#1.base, 1 + cstrpbrk_#t~post212#1.offset;havoc cstrpbrk_#t~post212#1.base, cstrpbrk_#t~post212#1.offset;" "assume true;call cstrpbrk_#t~mem205#1 := read~int#0(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);" "assume 0 != cstrpbrk_#t~mem205#1;havoc cstrpbrk_#t~mem205#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem206#1 := read~int#0(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem206#1;havoc cstrpbrk_#t~mem206#1;" [2025-03-04 15:42:53,941 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrpbrk_#t~mem207#1 := read~int#1(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short209#1 := 0 != cstrpbrk_#t~mem207#1;" "assume cstrpbrk_#t~short209#1;call cstrpbrk_#t~mem208#1 := read~int#1(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short209#1 := cstrpbrk_#t~mem208#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256);" "assume cstrpbrk_#t~short209#1;havoc cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~short209#1;cstrpbrk_#t~post210#1.base, cstrpbrk_#t~post210#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post210#1.base, cstrpbrk_#t~post210#1.offset - 1;" [2025-03-04 15:42:53,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:53,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2035652237, now seen corresponding path program 2 times [2025-03-04 15:42:53,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:42:53,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778064307] [2025-03-04 15:42:53,941 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:42:53,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:42:53,947 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 15:42:53,960 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:42:53,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:42:53,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:53,961 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:42:53,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:42:53,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:42:53,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:53,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:53,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:42:53,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:53,982 INFO L85 PathProgramCache]: Analyzing trace with hash 47600, now seen corresponding path program 3 times [2025-03-04 15:42:53,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:42:53,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733854955] [2025-03-04 15:42:53,982 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:42:53,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:42:53,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:42:53,987 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:42:53,987 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:42:53,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:53,987 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:42:53,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:42:53,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:42:53,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:53,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:53,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:42:53,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:53,993 INFO L85 PathProgramCache]: Analyzing trace with hash 822444862, now seen corresponding path program 1 times [2025-03-04 15:42:53,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:42:53,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620236030] [2025-03-04 15:42:53,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:42:53,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:42:54,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:42:54,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:42:54,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:54,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:54,019 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:42:54,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:42:54,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:42:54,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:54,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:42:54,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:42:54,805 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:42:54,805 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:42:54,805 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:42:54,805 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:42:54,805 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:42:54,805 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:54,805 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:42:54,805 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:42:54,805 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_mixed_alloca.i_Iteration5_Lasso [2025-03-04 15:42:54,805 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:42:54,805 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:42:54,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:54,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:54,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:54,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:54,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:54,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:54,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:54,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:54,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:54,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:54,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:54,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:54,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:54,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:54,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:54,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:54,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:54,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:55,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:55,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:55,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:55,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:55,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:55,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:55,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:55,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:55,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:42:55,725 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:42:55,725 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:42:55,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:55,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:55,727 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:55,729 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:55,730 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:55,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:55,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:55,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:55,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:55,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:55,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:55,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:55,741 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:55,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-04 15:42:55,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:55,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:55,748 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:55,748 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:55,749 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:55,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:55,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:55,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:55,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:55,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:55,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:55,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:55,761 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:55,766 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:42:55,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:55,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:55,768 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:42:55,769 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:42:55,770 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:55,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:55,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:55,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:55,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:55,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:55,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:55,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:55,781 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:55,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-04 15:42:55,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:55,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:55,788 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:42:55,788 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:42:55,793 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:55,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:55,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:55,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:55,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:55,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:55,803 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:55,803 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:55,804 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:55,809 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:42:55,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:55,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:55,811 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:42:55,811 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:42:55,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:42:55,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:55,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:55,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:55,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:55,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:55,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:55,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:55,823 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:55,828 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:42:55,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:55,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:55,830 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:42:55,831 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:42:55,832 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:55,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:55,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:55,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:55,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:55,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:55,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:55,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:55,843 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:55,848 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:42:55,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:55,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:55,850 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:42:55,851 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:42:55,852 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:55,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:55,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:55,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:55,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:55,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:55,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:55,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:55,862 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:55,867 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:42:55,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:55,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:55,869 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:42:55,870 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:42:55,871 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:55,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:55,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:55,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:55,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:55,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:55,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:55,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:55,882 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:55,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-04 15:42:55,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:55,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:55,889 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:42:55,889 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:42:55,890 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:55,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:55,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:55,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:55,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:55,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:55,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:55,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:55,901 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:55,907 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:42:55,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:55,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:55,908 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:42:55,909 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:42:55,910 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:55,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:55,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:55,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:55,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:55,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:42:55,921 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:42:55,923 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:55,928 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:42:55,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:55,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:55,930 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:42:55,931 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:42:55,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:42:55,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:55,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:55,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:55,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:55,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:55,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:55,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:55,943 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:55,949 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:42:55,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:55,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:55,951 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:42:55,953 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:42:55,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:42:55,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:55,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:55,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:55,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:55,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:55,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:55,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:55,964 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:55,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-04 15:42:55,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:55,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:55,970 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:42:55,971 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:42:55,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:42:55,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:55,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:55,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:55,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:55,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:55,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:55,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:55,983 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:55,988 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:42:55,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:55,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:55,990 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:42:55,993 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:42:55,993 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:56,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:56,005 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:56,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:56,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:56,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:56,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:56,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:56,006 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:56,012 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:42:56,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:56,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:56,014 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:42:56,015 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:42:56,015 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:56,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:56,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:56,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:56,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:56,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:56,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:56,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:56,026 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:56,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-04 15:42:56,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:56,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:56,034 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:42:56,036 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:42:56,037 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:56,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:56,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:56,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:56,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:56,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:56,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:56,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:56,048 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:56,054 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:42:56,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:56,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:56,056 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:42:56,057 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:42:56,057 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:56,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:56,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:42:56,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:56,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:56,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:56,067 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:42:56,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:42:56,068 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:56,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-04 15:42:56,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:56,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:56,076 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:42:56,077 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:42:56,079 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:56,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:56,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:56,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:56,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:56,090 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:42:56,090 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:42:56,098 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:56,103 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:42:56,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:56,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:56,105 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:42:56,106 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:42:56,107 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:56,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:56,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:56,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:56,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:56,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:42:56,119 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:42:56,123 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:56,130 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:42:56,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:56,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:56,132 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:42:56,132 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:42:56,133 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:56,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:56,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:56,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:56,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:56,143 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:42:56,143 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:42:56,145 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:42:56,151 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:42:56,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:56,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:56,154 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:42:56,154 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:42:56,155 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:56,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:42:56,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:42:56,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:42:56,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:42:56,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:42:56,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:42:56,175 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:42:56,189 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-04 15:42:56,189 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-03-04 15:42:56,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:42:56,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:42:56,195 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:42:56,196 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:42:56,196 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:42:56,207 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:42:56,207 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:42:56,208 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0#1.offset, v_rep(select #length ULTIMATE.start_cstrpbrk_~s2#1.base)_3) = 2*ULTIMATE.start_cstrpbrk_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s2#1.base)_3 Supporting invariants [] [2025-03-04 15:42:56,214 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:42:56,244 INFO L156 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2025-03-04 15:42:56,246 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-04 15:42:56,246 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 15:42:56,246 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 15:42:56,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:56,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:42:56,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:42:56,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:56,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:42:56,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:42:56,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:42:56,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:42:56,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:42:56,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:56,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:42:56,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:42:56,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:42:56,333 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:56,334 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:42:56,334 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:42:56,362 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:42:56,363 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:56,364 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:42:56,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2025-03-04 15:42:56,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-04 15:42:56,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:42:56,364 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:42:56,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:56,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:42:56,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:42:56,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:56,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:42:56,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:42:56,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:42:56,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:42:56,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:42:56,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:56,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:42:56,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:42:56,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:42:56,437 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:56,437 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:42:56,438 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:42:56,466 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:42:56,467 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:56,468 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:42:56,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2025-03-04 15:42:56,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-04 15:42:56,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:42:56,468 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:42:56,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:42:56,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:42:56,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:42:56,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:56,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:42:56,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:42:56,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:42:56,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:42:56,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:42:56,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:42:56,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:42:56,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:42:56,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:42:56,540 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:56,541 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:42:56,541 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:42:56,573 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:42:56,573 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:56,574 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:42:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2025-03-04 15:42:56,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-04 15:42:56,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:42:56,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 17 letters. Loop has 3 letters. [2025-03-04 15:42:56,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:42:56,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 14 letters. Loop has 6 letters. [2025-03-04 15:42:56,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:42:56,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 47 transitions. [2025-03-04 15:42:56,576 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:42:56,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2025-03-04 15:42:56,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:42:56,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:42:56,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:42:56,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:42:56,576 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:42:56,576 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:42:56,576 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:42:56,577 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:42:56,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 15:42:56,577 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:42:56,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 15:42:56,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:42:56 BoogieIcfgContainer [2025-03-04 15:42:56,582 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:42:56,583 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:42:56,583 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:42:56,583 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:42:56,583 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:49" (3/4) ... [2025-03-04 15:42:56,585 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 15:42:56,585 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:42:56,586 INFO L158 Benchmark]: Toolchain (without parser) took 7782.15ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 111.4MB in the beginning and 86.2MB in the end (delta: 25.3MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. [2025-03-04 15:42:56,586 INFO L158 Benchmark]: CDTParser took 1.10ms. Allocated memory is still 201.3MB. Free memory is still 121.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:42:56,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.65ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 93.0MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:42:56,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.79ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 91.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:42:56,586 INFO L158 Benchmark]: Boogie Preprocessor took 22.68ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 89.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:42:56,587 INFO L158 Benchmark]: IcfgBuilder took 237.86ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 76.1MB in the end (delta: 13.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:42:56,587 INFO L158 Benchmark]: BuchiAutomizer took 7165.30ms. 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 86.2MB in the end (delta: -10.1MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2025-03-04 15:42:56,587 INFO L158 Benchmark]: Witness Printer took 2.61ms. Allocated memory is still 176.2MB. Free memory was 86.2MB in the beginning and 86.2MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:42:56,588 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.10ms. Allocated memory is still 201.3MB. Free memory is still 121.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.65ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 93.0MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.79ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 91.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.68ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 89.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 237.86ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 76.1MB in the end (delta: 13.4MB). There was no memory consumed. Max. memory is 16.1GB. * BuchiAutomizer took 7165.30ms. 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 86.2MB in the end (delta: -10.1MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * Witness Printer took 2.61ms. Allocated memory is still 176.2MB. Free memory was 86.2MB in the beginning and 86.2MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~sc1~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 3 locations. One deterministic module has affine ranking function null and consists of 3 locations. One nondeterministic module has affine ranking function null and consists of 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.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 6.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. 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, 86 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 85 mSDsluCounter, 149 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 83 IncrementalHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 96 mSDtfsCounter, 83 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital238 mio100 ax100 hnf100 lsp111 ukn67 mio100 lsp30 div174 bol100 ite100 ukn100 eq155 hnf94 smp67 dnf750 smp23 tf101 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 123ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 108 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:42:56,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-03-04 15:42:56,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE